Advertisement

A language and axioms for explicit mathematics

  • Solomon Feferman
Conference paper
Part of the Lecture Notes in Mathematics book series (LNM, volume 450)

Keywords

Classical Logic Finite Type Atomic Formula Proof Theory Conservative Extension 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. [69]
    BARWISE, J. Infinitary logic and admissible sets, J. Symb. Logic 34, 1969, 226–252.MathSciNetCrossRefzbMATHGoogle Scholar
  2. [67]
    BISHOP, E. Foundations of Constructive Analysis, McGraw-Hill, New York, 1967.zbMATHGoogle Scholar
  3. [70]
    Mathematics as a Numerical Language, in Intuitionism and proof theory (eds. Kino, Myhill, Vesley), North-Holland, Amsterdam, 1970.Google Scholar
  4. [72]
    BISHOP, E. and H. CHANG Constructive measure theory, Memoirs A.M.S. no. 116, 1972.Google Scholar
  5. [14]
    BOREL, E. (et al) Cinq lettres sur la théorie des ensembles, repr. in Leçons sur la théorie des fonctions, 2nd ed., Gauthier-Villars, Paris, 1914, 150–160.Google Scholar
  6. [68]
    CLEAVE, J.P. The theory of hyperarithmetic and π11-models, in Proc. Summer School in Logic, Lecture Notes in Maths. 70, Springer, Berlin, 1968, 223–240.Google Scholar
  7. [to appear]
    COCCHIARELLA, N.B. Formal ontology and the foundations of mathematics, in the Philosophy of Bertrand Russell: A Centenary Tribute (ed. Nakhnikian), to appear.Google Scholar
  8. [69]
    CROSSLEY, J.N. Constructive Order Types, North-Holland, Amsterdam, 1969.zbMATHGoogle Scholar
  9. [72]
    CUTLAND, N. π11-models and π11-categoricity, in Conf. in Math. Logic, London '70, Lecture Notes in Maths. 255, Springer, Berlin, 1972, 42–61.CrossRefGoogle Scholar
  10. [60]
    DEKKER, J.C.E. and J. MYHILL Recursive Equivalence Types, U. Calif. Publs. in Maths. 3, 1960, 67–214.MathSciNetzbMATHGoogle Scholar
  11. [68a]
    ERSHOV, Yu.L. Numbered fields, in Logic, Methodology and Philosophy of Science III (eds. van Rootselaar, Staal), North-Holland, Amsterdam, 1968.Google Scholar
  12. [64]
    FEFERMAN, S. Systems of predicative analysis, J. Symb. Logic 29, 1964, 1–30.MathSciNetCrossRefzbMATHGoogle Scholar
  13. [68b]
    Autonomous transfinite progressions and the extent of predicative mathematics, in Logic, Methodology and Philosophy of Science III, North-Holland, Amsterdam, 1968.Google Scholar
  14. [70]
    Ordinals and functionals in proof theory, in Proc. Int. Cong. Maths. Nice, 1970, V.1, 229–233.MathSciNetGoogle Scholar
  15. [Ms]
    Some formal systems for the unlimited theory of structures and categories, unpublished Ms.Google Scholar
  16. [71]
    FRIEDMAN, H. Axiomatic recursive function theory, in Logic Colloquium '69 (eds. Gandy, Yates), North-Holland, Amsterdam, 1971, 113–137.CrossRefGoogle Scholar
  17. [70]
    GILMORE, P.C. Attributes, sets, partial sets and identity, Compos. Math. 20, 1960, 53–79.MathSciNetzbMATHGoogle Scholar
  18. [71a]
    GIRARD, J.-Y. Une extension de l'interpretation de Gödel à l'analyse, et son application a l'élimination des coupures dans l'analyse et la théorie des types, in Proc. 2nd Scand. Logic Sympos. (ed. Fendstadt), North-Holland, Amsterdam, 1971, 63–92.CrossRefGoogle Scholar
  19. [58]
    GÖDEL, K. Über eine bisher noch nicht benutzte Erweiterung des finiten Standpunktes, Dialectica 12, 1958, 280–287.MathSciNetCrossRefzbMATHGoogle Scholar
  20. [72a]
    GOODMAN, N. and J. MYHILL The formalization of Bishop's constructive mathematics, in Toposes, algebraic geometry and logic, Lecture Notes in Maths. 274, Springer, Berlin, 1972, 83–96.CrossRefGoogle Scholar
  21. [72]
    HEYTING, A. Intuitionism, an introduction, (3rd rev. edn.), North-Holland, Amsterdam, 1972.zbMATHGoogle Scholar
  22. [72]
    HOWARD, W.A. A system of abstract constructive ordinals, J. Symb. Logic 37, 1972, 355–374.MathSciNetCrossRefzbMATHGoogle Scholar
  23. [52]
    KLEENE, S.C. Introduction to metamathematics, Van Nostrand, New York, 1952.zbMATHGoogle Scholar
  24. [59]
    Recursive functionals and quantifiers of finite types I, Trans. A.M.S. 91, 1959, 1–52.MathSciNetzbMATHGoogle Scholar
  25. [59]
    KREISEL, G. Analysis of the Cantor-Bendixson theorem by means of the analytic hierarchy, Bull. Pol Acad. Sci. 7, 1959, 621–626.MathSciNetzbMATHGoogle Scholar
  26. [65a]
    Mathematical logic, in Lectures in Modern Mathematics, III, (ed. Saaty), Wiley, New York, 1965, 95–195.Google Scholar
  27. [70]
    Principles of proof and ordinals implicit in given concepts, in Intuitionism and proof theory, North-Holland, Amsterdam, 1970.zbMATHGoogle Scholar
  28. [71b]
    Some reasons for generalizing recursion theory, in Logic Colloquium '69 (eds. Gandy, Yates), North-Holland, Amsterdam, 1971, 139–198.CrossRefGoogle Scholar
  29. [to appear]
    KREISEL, G. From proof theory to a theory of proofs, 1974 AAAS Symp., to appear.Google Scholar
  30. [70]
    KREISEL, G. and A.S. TROELSTRA Formal systems for some branches of intuitionistic analysis, Annals Math. Logic 1, 1970, 229–387.MathSciNetCrossRefzbMATHGoogle Scholar
  31. [59]
    LACOMBE, D. Quelques procédés de définition en topologie récursive, in Constructivity in Mathematics (ed. Heyting), North-Holland, Amsterdam, 1959, 129–158.Google Scholar
  32. [69]
    LARSON, A. A case study of predicative mathematics: uniform spaces, completions and algebraic number theory. Dissertation, Stanford University, 1969.Google Scholar
  33. [65]
    LORENZEN, P. Differential and Integral: Eine konstruktive Einführing in die klassische analysis, Akad. Verlag, Frankfurt, 1965.zbMATHGoogle Scholar
  34. [71d]
    MAL'CEV, A.I. The metamathematics of algebraic systems; collected papers: 1936–1967, (transl., ed. Wells), North-Holland, Amsterdam, 1971, Chps. 18, 22, 24.Google Scholar
  35. [preliminary Ms]
    MARTIN-LÖF, P. An intuitionistic theory of types.Google Scholar
  36. [69]
    MOSCHOVAKIS, Y.N. Abstract first order computability, I, Trans. A.M.S. 138, 1969, 427–464.MathSciNetzbMATHGoogle Scholar
  37. [62]
    RABIN, M. Computable algebra; general theory and theory of commutative fields, Trans. A.M.S. 95, 1962, 341–360.MathSciNetzbMATHGoogle Scholar
  38. [68]
    SANIN, N.A. Constructive real numbers and function spaces, 21, Translations of Mathematical Monographs, A.M.S., Providence, 1968.Google Scholar
  39. [70a]
    SCOTT, D. Constructive validity, in Symposium on Automatic Demonstration, Lecture Notes in Maths. 125, Springer, Berlin, 1970, 237–275.CrossRefGoogle Scholar
  40. [59a]
    SPECKER, E. Der Satz vom Maximum in der rekursiven Analysis, in Constructivity in Mathematics, (ed. Heyting), North-Holland, Amsterdam, 1959, 254–265.Google Scholar
  41. [65b]
    TAIT, W.W. Infinitely long terms of transfinite type, in Formal Systems and Recursive Functions, (eds. Crossley, Dummett), North-Holland, Amsterdam, 1965, 176–185.CrossRefGoogle Scholar
  42. [68c]
    Constructive reasoning, in Logic, Methodology and Philosophy of Science III (eds. van Rootselaar, Staal), North-Holland, Amsterdam, 1968.Google Scholar
  43. [69]
    TROELSTRA, A.S. Principles of intuitionism, Lecture Notes in Maths. 95, Springer, Berlin, 1969.zbMATHGoogle Scholar
  44. [73]
    Metamathematical investigation of intuitionistic arithmetic and analysis, Lecture Notes in Maths. 344, Springer, Berlin, 1973.zbMATHGoogle Scholar
  45. [66]
    TSEYTIN, G.D., I.D. ZASLAVSKY and N.A. SHANIN Peculiarities of constructive mathematical analysis, in Proc. Int. Cong. Maths., Moscow, 1966, 253–261.Google Scholar
  46. [73]
    ZUCKER, J.I. Iterated inductive definitions, trees and ordinals, in (Troelstra [73]), Ch. VI, 392–453.Google Scholar

Copyright information

© Springer-Verlag 1975

Authors and Affiliations

  • Solomon Feferman
    • 1
  1. 1.Department of MathematicsStanford UniversityStanford

Personalised recommendations