You are not currently logged in.
Access your personal account or get JSTOR access through your library or other institution:
If You Use a Screen ReaderThis content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Single Premise Post Canonical Forms Defined Over One-Letter Alphabets
Charles E. Hughes
The Journal of Symbolic Logic
Vol. 39, No. 3 (Sep., 1974), pp. 489-495
Published by: Association for Symbolic Logic
Stable URL: http://www.jstor.org/stable/2272891
Page Count: 7
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
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.
The Journal of Symbolic Logic © 1974 Association for Symbolic Logic