A Foundation of Finite Mathematics

[1]  M. H. Lob.  Formal Systems of Constructive Mathematics , 1956, J. Symb. Log..

[2]  Georg Kreisel,et al.  Mathematical significance of consistency proofs , 1958, Journal of Symbolic Logic.

[3]  D. Rödding.  Primitiv-Rekursive Funktionen Über Einem Bereich Endlicher Mengen , 1968 .

[4]  H. Weyl.  Randbemerkungen zu Hauptproblemen der Mathematik , 1924 .

[5]  Rozsa Peter.  Review: Andrzej Grzegorczyk, Some Classes of Recursive Functions , 1955 .

[6]  P. Bernays,et al.  Grundlagen der Mathematik , 1934 .

[7]  K. Gödel.  The Consistency of the Axiom of Choice and of the Generalized Continuum-Hypothesis. , 1938, Proceedings of the National Academy of Sciences of the United States of America.

[8]  Haskell B. Curry.  A Formalization of Recursive Arithmetic , 1941 .

[9]  P. J. Cohen.  Set Theory and the Continuum Hypothesis , 1966 .

[10]  Moto-o Takahashi.  Ackermann's model and recursive predicates , 1968 .

[11]  P. Axt.  Iteration of Primitive Recursion , 1965 .

[12]  小野 勝次.  Logische Untersuchungen uber die Grundlagen der Mathematik , 1939 .

[13]  P. Rosenbloom,et al.  An Elementary Constructive Proof of the Fundamental Theorem of Algebra , 1945 .

[14]  Pierre Samuel,et al.  Algebraic theory of numbers , 1971 .

[15]  A. Church.  An Unsolvable Problem of Elementary Number Theory , 1936 .

[16]  Ann Yasuhara,et al.  Recursive function theory and logic , 1971, Computer science and applied mathematics.

[17]  T. Skolem.  Eine Bemerkung über die Induktionsschemata in der rekursiven Zahlentheorie , 1939 .

[18]  M. H. Lob,et al.  Solution of a Problem of Leon Henkin , 1955, J. Symb. Log..

[19]  M. E. Szabo,et al.  The collected papers of Gerhard Gentzen , 1969 .

[20]  M. H. Lob,et al.  Concatenation as Basis for a Complete System of Arithmetic , 1953, J. Symb. Log..

[21]  David Nelson.  Recursive functions and intuitionistic number theory , 1947 .

[22]  R. Peter,et al.  Über den Zusammenhang der verschiedenen Begriffe der rekursiven Funktion , 1935 .

[23]  R. D. Richtmyer,et al.  Introduction to the foundations of mathematics , 1953 .

[24]  Moto-O. Takahashi.  Many-Valued Logics of Extended Gentzen Style II , 1970, J. Symb. Log..

[25]  R. Goodstein.  Logic-free formalisations of recursive arithmetic , 1954 .

[26]  H. Schwichtenberg,et al.  Rekursionszahlen und die Grzegorczyk-Hierarchie , 1969 .

[27]  G. E. Mints.  Quantifier-free and one-quantifier systems , 1972 .

[28]  A. Heyting,et al.  Intuitionism: An introduction , 1956 .

[29]  Rödding D.. Klassen rekursiver Funktionen. Proceedings of the summer school in logic, Leeds, 1967, herausgegeben von M. H. Löb, Lecture notes in mathematics, no. 70, Springer-Verlag, Berlin, Heidelberg, und New York, 1968, S. 159–222. , 1972 .

[30]  Bruce Lercher,et al.  Recursive Number Theory , 1958, The Mathematical Gazette.

[31]  C. Parsons.  On a Number Theoretic Choice Schema and its Relation to Induction , 1970 .

[32]  Von Kurt Gödel,et al.  ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES , 1958 .

[33]  A. Levy,et al.  A hierarchy of formulas in set theory , 1965 .

[34]  Atle Selberg,et al.  An Elementary Proof of Dirichlet's Theorem About Primes in an Arithmetic Progression , 1949 .

[35]  John R. Myhill.  A Complete Theory of Natural, Rational, and Real Numbers , 1950, J. Symb. Log..

[36]  R. L. Goodstein,et al.  On the restricted ordinal theorem , 1944, Journal of Symbolic Logic.

[37]  S. C. Kleene,et al.  Introduction to Metamathematics , 1952 .

[38]  R. L. Goodstein.  Transfinite Ordinals in Recursive Number Theory , 1947, J. Symb. Log..

[39]  Paul Axt,et al.  Enumeration and the Grzegorczyk Hierarchy , 1963 .

[40]  David Burton.  Elementary Number Theory , 1976 .

[41]  R. Dedekind,et al.  Was sind und was sollen die Zahlen , 1961 .