Category methods in recursion theory.
J. Myhill
Source: Pacific J. Math. Volume 11, Number 4 (1961), 1479-1486.
Primary Subjects: 02.70
Full-text: Open access
Links and Identifiers
Permanent link to this document: http://projecteuclid.org/euclid.pjm/1103036931
Zentralblatt MATH identifier:
0112.24601
Mathematical Reviews number (MathSciNet):
MR0136544
References
[1] John Addison, Separation principles in the hierarchies of classical and effective de- scriptive set-theory, Fund. Math., 46 (1959), 123-135.
Mathematical Reviews (MathSciNet):
MR24:A1209
Zentralblatt MATH:
0091.05201
[2] Martin Davis, Computabilty and unsolvability, New York, McGraw, Hill, 1958, xxv -f- 210 pp.
Mathematical Reviews (MathSciNet):
MR23:A1525
Zentralblatt MATH:
0080.00902
[3] Jacob Dekker and John Myhill, Recursion theory, to be published by North Holland.
[4] Richard Friedberg, Two recursively enumerable sets of incomparable degrees of unsol- vability, Proc. Nat. Acad. Sci. U.S.A., 43 (1957), 236-238.
Mathematical Reviews (MathSciNet):
MR18:867a
[5] Stephen Kleene, Introductionto metamathematics,New York, Van Nostrand, 1952, x -f 550 pp.
Mathematical Reviews (MathSciNet):
MR14:525m
Zentralblatt MATH:
0047.00703
[6] Stephen Kleene, Recursive functionsand intuitionisticmathematics,Proc. Int. Cong. Math. (Cambridge, Mass., U.S.A.) 1 (1952), 679-685.
Mathematical Reviews (MathSciNet):
MR13:422a
Zentralblatt MATH:
0049.15001
[7] Stephen Kleene and Emil Post, The upper semi-lattice of degrees of recursive unsol- vability, Ann. of Math., ser. 2, 59 (1954), 379-407.
Mathematical Reviews (MathSciNet):
MR15:772a
Zentralblatt MATH:
0057.24703
[8] A. V. Kuznecov and B. A. Trahtenbrot Investigation of partial recursive oparators by means of the otheoryf Baire space, Proc. Acad. Sci. USSR, 1O5 (1955), 897-900.
Mathematical Reviews (MathSciNet):
MR17:1039a
[9] Daniel Lacombe, Sur le semi-reseau constitute par les degres dHndecidabilite recursive, C. R., 239 (1954), 1108-1109.
Mathematical Reviews (MathSciNet):
MR16:555i
Zentralblatt MATH:
0058.00701
[10] Daniel Lacombe, Quelques procedes de definition en topologie recursive, in Constructivity in Mathematics, Amsterdam, North Holland, (1958), 129-158.
Mathematical Reviews (MathSciNet):
MR22:3687
Zentralblatt MATH:
0089.00701
[11] A. A. Mucnik, Negative anser to the problem of reducibility of the theory of algorithmst Proc. Acad. Sci. USSR, 18 (1956), 194-197.
[12] John Myhill, Note on degrees of partial functions,Proc. Amer. Math. Soc, 12 (1961), 519-521.
Mathematical Reviews (MathSciNet):
MR23:A3091
Zentralblatt MATH:
0101.01201
[13] John Myhill and John Shepherdson, Effective operations on partial recursive functions, Zeit. fur Math. Logik u. Grund. der Math., 1 (1955), 310-317.
Mathematical Reviews (MathSciNet):
MR17:1039b
Zentralblatt MATH:
0068.24706
[14] Joseph Shoenfield An uncountable set of incomparable degrees, Proc. Amer. Math. Soc, 11 (1960), 61-62.
Mathematical Reviews (MathSciNet):
MR22:7937
Zentralblatt MATH:
0109.24105
[15] Joseph Shoenfield An uncountable set of incomparable degrees, On degrees of unsolvability, Ann. of Math., ser. 2, 69 (1959), 644-653.
Mathematical Reviews (MathSciNet):
MR22:7937
Zentralblatt MATH:
0109.24105
[16] Waclaw Sierpiski, Hypothese du continu, New York, Chelsea, 1956, xvii + 274 pp.
Mathematical Reviews (MathSciNet):
MR19:829c
Zentralblatt MATH:
0075.00903
[17] Raymond Smullyan, Theory of formal systems, Annals of Mathematics Studies, No. 47.
Mathematical Reviews (MathSciNet):
MR22:12042
Zentralblatt MATH:
0097.24503
[18] Clifford Spector, Measure-theoretic construction of incomparable hyperdegrees, ]. Symb. Log., 23 (1958), 280-288.
Mathematical Reviews (MathSciNet):
MR22:3681
Zentralblatt MATH:
0085.24901
[19] Clifford Spector, On degrees of recursive unsolvability, Ann. of Math., 64 (1956), 580- 592.
Mathematical Reviews (MathSciNet):
MR18:552d
Zentralblatt MATH:
0074.01302
[20] B. A. Trahtenbrot, Matrix representation of recursive operators, Proc. Acad. Sci. USSR, 101 (1955), 417-420.
Mathematical Reviews (MathSciNet):
MR18:457b
Pacific Journal of Mathematics