Arithmetical predicates and function quantifiers

Arithmetical predicates and function quantifiers
HTML articles powered by AMS MathViewer

by S. C. Kleene

Trans. Amer. Math. Soc. 79 (1955), 312-340

DOI: https://doi.org/10.1090/S0002-9947-1955-0070594-4

PDF | Request permission

References

Alonzo Church, A set of postulates for the foundation of logic, Ann. of Math. (2) 33 (1932), no. 2, 346–366. MR 1503059, DOI 10.2307/1968337

On the theory of recursive unsolvability

Relatively recursive functions and the extended Kleene hierarchy

On notation for ordinal numbers

S. C. Kleene, Recursive predicates and quantifiers, Trans. Amer. Math. Soc. 53 (1943), 41–73. MR 7371, DOI 10.1090/S0002-9947-1943-0007371-8
S. C. Kleene, On the forms of the predicates in the theory of constructive ordinals, Amer. J. Math. 66 (1944), 41–58. MR 9757, DOI 10.2307/2371894
S. C. Kleene, Recursive functions and intuitionistic mathematics, Proceedings of the International Congress of Mathematicians, Cambridge, Mass., 1950, vol. 1, Amer. Math. Soc., Providence, R.I., 1952, pp. 679–685. MR 0044468
Stephen Cole Kleene, Introduction to metamathematics, D. Van Nostrand Co., Inc., New York, N. Y., 1952. MR 0051790
S. C. Kleene, On the forms of the predicates in the theory of constructive ordinals, Amer. J. Math. 66 (1944), 41–58. MR 9757, DOI 10.2307/2371894
S. C. Kleene, Hierarchies of number-theoretic predicates, Bull. Amer. Math. Soc. 61 (1955), 193–213. MR 70593, DOI 10.1090/S0002-9904-1955-09896-3
S. C. Kleene and Emil L. Post, The upper semi-lattice of degrees of recursive unsolvability, Ann. of Math. (2) 59 (1954), 379–407. MR 61078, DOI 10.2307/1969708
P. Lorenzen, Die Definition durch vollständige Induktion, Monatsh. Math. Phys. 47 (1939), 356–358. MR 38, DOI 10.1007/BF01695507

On the interpretation of non-finitist proofs

G. Kreisel, A variant to Hilbert’s theory of the foundations of arithmetic, British J. Philos. Sci. 4 (1953), 107–129 errata and corrigenda, 357 (1954). MR 60442, DOI 10.1093/bjps/IV.14.107
Andrzej Mostowski, On definable sets of positive integers, Fund. Math. 34 (1947), 81–112. MR 21923, DOI 10.4064/fm-34-1-81-112

A classification of logical systems

John Myhill, Arithmetic with creative definitions by induction, J. Symbolic Logic 18 (1953), 115–118. MR 62083, DOI 10.2307/2268943

Über den Zusammenhang der verschiedenen Begriffe der rekursiven Funktion

Emil L. Post, Recursively enumerable sets of positive integers and their decision problems, Bull. Amer. Math. Soc. 50 (1944), 284–316. MR 10514, DOI 10.1090/S0002-9904-1944-08111-1

Degrees of recursive unsolvability

Über die Zurückführbarkeit einiger durch Rekursionen definierten Relationen auf “arithmetische"

Clifford Spector, Recursive well-orderings, J. Symbolic Logic 20 (1955), 151–163. MR 74347, DOI 10.2307/2266902
Alfred Tarski, Einige Betrachtungen über die Begriffe der $\omega$-Widerspruchsfreiheit und der $\omega$-Vollständigkeit, Monatsh. Math. Phys. 40 (1933), no. 1, 97–112 (German). MR 1550192, DOI 10.1007/BF01708855
Alfred Tarski, A problem concerning the notion of definability, J. Symbolic Logic 13 (1948), 107–111. MR 26625, DOI 10.2307/2267331
Hao Wang, Certain predicates defined by induction schemata, J. Symbolic Logic 18 (1953), 49–59. MR 54535, DOI 10.2307/2266327