Hostname: page-component-78c5997874-s2hrs Total loading time: 0 Render date: 2024-11-16T16:16:23.653Z Has data issue: false hasContentIssue false
  • English
  • Français

Single premise Post canonical forms defined over one-letter alphabets

Published online by Cambridge University Press:  12 March 2014

Charles E. Hughes
Charles E. Hughes*
Affiliation:
Pennsylvania State University, University Park, Pennsylvania 16802
Get access Rights & Permissions [Opens in a new window]

Abstract

In this paper we investigate some families of decision problems associated with a restricted class of Post canonical forms, specifically, those defined over one-letter alphabets whose productions have single premises and contain only one variable. For brevity sake, we call any such form an RPCF (Restricted Post Canonical Form). Constructive proofs are given which show, for any prescribed nonrecursive r.e. many-one degree of unsolvability D, the existence of an RPCF whose word problem is of degree D and an RPCF with axiom whose-decision problem is also of degree D. Finally, we show that both of these results are best possible in that they do not hold for one-one degrees.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 39 , Issue 3 , September 1974 , pp. 489 - 495
Copyright
Copyright © Association for Symbolic Logic 1974

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

BIBLIOGRAPHY

[1]Hosken, W. H., Some Post canonical systems in one letter, BIT, vol. 12 (1972), pp. 509–515.CrossRefGoogle Scholar
[2]Hughes, C. E., Many-one degrees associated with problems of tag, this Journal, vol. 38 (1973), pp. 1–17.Google Scholar
[3]Overbeek, R., The representation of many-one degrees by decision problems of Turing machines, Proceedings of the London Mathematical Society (3), vol. 26 (1973), pp. 167–183.Google Scholar
[4]Post, E. L., Formal reductions of the general combinatorial decision problems, American Journal of Mathematics, vol. 65 (1943), pp. 197–215.CrossRefGoogle Scholar
[5]Post, E. L., Recursively enumerable sets of positive integers and their decision problems, Bulletin of the American Mathematical Society, vol. 50 (1944), pp. 284–316.CrossRefGoogle Scholar
[6]Shepherdson, J. C., Machine configuration and word problems of given degree of unsolvability, Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 11 (1965), pp. 149–175.CrossRefGoogle Scholar