Abstract
AbstractA constructive proof is given which shows that every nonrecursive r.e. many-one degree is represented by the family of decision problems for partial implicational propositional calculi whose well-formed formulas contain at most two distinct variable symbols.
Publisher
Cambridge University Press (CUP)
Reference7 articles.
1. The Representation of Many-One Degrees by Decision Problems of Turing Machines
2. Recursive unsolvability of a complex of problems proposed by Post;Singletary;Journal of the Mathematical Society of Japan,1967
3. Axiomatization of the three-valued propositional logic;Wajsberg;Comptes Rendus des Séances de la Société des Sciences et des Lettres de Varsovie Classe II,1931
4. A detailed argument for the Post-Linial theorems.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献