Skip to main content
SpringerLink
Log in

A language and axioms for explicit mathematics

  • Conference paper
  • First Online:
Algebra and Logic

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 450))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 44.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.95
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. BARWISE, J. Infinitary logic and admissible sets, J. Symb. Logic 34, 1969, 226–252.

    Article  MathSciNet  MATH  Google Scholar 

  2. BISHOP, E. Foundations of Constructive Analysis, McGraw-Hill, New York, 1967.

    MATH  Google Scholar 

  3. Mathematics as a Numerical Language, in Intuitionism and proof theory (eds. Kino, Myhill, Vesley), North-Holland, Amsterdam, 1970.

    Google Scholar 

  4. BISHOP, E. and H. CHANG Constructive measure theory, Memoirs A.M.S. no. 116, 1972.

    Google Scholar 

  5. 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. 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. 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. CROSSLEY, J.N. Constructive Order Types, North-Holland, Amsterdam, 1969.

    MATH  Google Scholar 

  9. CUTLAND, N. π 11 -models and π 11 -categoricity, in Conf. in Math. Logic, London '70, Lecture Notes in Maths. 255, Springer, Berlin, 1972, 42–61.

    Chapter  Google Scholar 

  10. DEKKER, J.C.E. and J. MYHILL Recursive Equivalence Types, U. Calif. Publs. in Maths. 3, 1960, 67–214.

    MathSciNet  MATH  Google Scholar 

  11. ERSHOV, Yu.L. Numbered fields, in Logic, Methodology and Philosophy of Science III (eds. van Rootselaar, Staal), North-Holland, Amsterdam, 1968.

    Google Scholar 

  12. FEFERMAN, S. Systems of predicative analysis, J. Symb. Logic 29, 1964, 1–30.

    Article  MathSciNet  MATH  Google Scholar 

  13. Autonomous transfinite progressions and the extent of predicative mathematics, in Logic, Methodology and Philosophy of Science III, North-Holland, Amsterdam, 1968.

    Google Scholar 

  14. Ordinals and functionals in proof theory, in Proc. Int. Cong. Maths. Nice, 1970, V.1, 229–233.

    MathSciNet  Google Scholar 

  15. Some formal systems for the unlimited theory of structures and categories, unpublished Ms.

    Google Scholar 

  16. FRIEDMAN, H. Axiomatic recursive function theory, in Logic Colloquium '69 (eds. Gandy, Yates), North-Holland, Amsterdam, 1971, 113–137.

    Chapter  Google Scholar 

  17. GILMORE, P.C. Attributes, sets, partial sets and identity, Compos. Math. 20, 1960, 53–79.

    MathSciNet  MATH  Google Scholar 

  18. 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.

    Chapter  Google Scholar 

  19. GÖDEL, K. Über eine bisher noch nicht benutzte Erweiterung des finiten Standpunktes, Dialectica 12, 1958, 280–287.

    Article  MathSciNet  MATH  Google Scholar 

  20. 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.

    Chapter  Google Scholar 

  21. HEYTING, A. Intuitionism, an introduction, (3rd rev. edn.), North-Holland, Amsterdam, 1972.

    MATH  Google Scholar 

  22. HOWARD, W.A. A system of abstract constructive ordinals, J. Symb. Logic 37, 1972, 355–374.

    Article  MathSciNet  MATH  Google Scholar 

  23. KLEENE, S.C. Introduction to metamathematics, Van Nostrand, New York, 1952.

    MATH  Google Scholar 

  24. Recursive functionals and quantifiers of finite types I, Trans. A.M.S. 91, 1959, 1–52.

    MathSciNet  MATH  Google Scholar 

  25. KREISEL, G. Analysis of the Cantor-Bendixson theorem by means of the analytic hierarchy, Bull. Pol Acad. Sci. 7, 1959, 621–626.

    MathSciNet  MATH  Google Scholar 

  26. Mathematical logic, in Lectures in Modern Mathematics, III, (ed. Saaty), Wiley, New York, 1965, 95–195.

    Google Scholar 

  27. Principles of proof and ordinals implicit in given concepts, in Intuitionism and proof theory, North-Holland, Amsterdam, 1970.

    MATH  Google Scholar 

  28. Some reasons for generalizing recursion theory, in Logic Colloquium '69 (eds. Gandy, Yates), North-Holland, Amsterdam, 1971, 139–198.

    Chapter  Google Scholar 

  29. KREISEL, G. From proof theory to a theory of proofs, 1974 AAAS Symp., to appear.

    Google Scholar 

  30. KREISEL, G. and A.S. TROELSTRA Formal systems for some branches of intuitionistic analysis, Annals Math. Logic 1, 1970, 229–387.

    Article  MathSciNet  MATH  Google Scholar 

  31. 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. LARSON, A. A case study of predicative mathematics: uniform spaces, completions and algebraic number theory. Dissertation, Stanford University, 1969.

    Google Scholar 

  33. LORENZEN, P. Differential and Integral: Eine konstruktive Einführing in die klassische analysis, Akad. Verlag, Frankfurt, 1965.

    MATH  Google Scholar 

  34. 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. MARTIN-LÖF, P. An intuitionistic theory of types.

    Google Scholar 

  36. MOSCHOVAKIS, Y.N. Abstract first order computability, I, Trans. A.M.S. 138, 1969, 427–464.

    MathSciNet  MATH  Google Scholar 

  37. RABIN, M. Computable algebra; general theory and theory of commutative fields, Trans. A.M.S. 95, 1962, 341–360.

    MathSciNet  MATH  Google Scholar 

  38. SANIN, N.A. Constructive real numbers and function spaces, 21, Translations of Mathematical Monographs, A.M.S., Providence, 1968.

    Google Scholar 

  39. SCOTT, D. Constructive validity, in Symposium on Automatic Demonstration, Lecture Notes in Maths. 125, Springer, Berlin, 1970, 237–275.

    Chapter  Google Scholar 

  40. 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. TAIT, W.W. Infinitely long terms of transfinite type, in Formal Systems and Recursive Functions, (eds. Crossley, Dummett), North-Holland, Amsterdam, 1965, 176–185.

    Chapter  Google Scholar 

  42. Constructive reasoning, in Logic, Methodology and Philosophy of Science III (eds. van Rootselaar, Staal), North-Holland, Amsterdam, 1968.

    Google Scholar 

  43. TROELSTRA, A.S. Principles of intuitionism, Lecture Notes in Maths. 95, Springer, Berlin, 1969.

    MATH  Google Scholar 

  44. Metamathematical investigation of intuitionistic arithmetic and analysis, Lecture Notes in Maths. 344, Springer, Berlin, 1973.

    MATH  Google Scholar 

  45. 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. ZUCKER, J.I. Iterated inductive definitions, trees and ordinals, in (Troelstra [73]), Ch. VI, 392–453.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Stanford University, Stanford, California

    Solomon Feferman

Authors
  1. Solomon Feferman
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

John Newsome Crossley

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Springer-Verlag

About this paper

Cite this paper

Feferman, S. (1975). A language and axioms for explicit mathematics. In: Crossley, J.N. (eds) Algebra and Logic. Lecture Notes in Mathematics, vol 450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0062852

Download citation

  • DOI: https://doi.org/10.1007/BFb0062852

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07152-5

  • Online ISBN: 978-3-540-37480-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation