Skip to main content
SpringerLink
Log in

Intensionality in mathematics

  • Published:
Journal of Philosophical Logic Aims and scope Submit manuscript

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  • M. Beeson, ‘Proving programs and programming proofs’, Proc. VIIth Int'l. Congress Logic, Methodology and Phil. of Sci. (Salzburg, 1983) (t.a.) (1984).

  • M. Beeson, Foundations of Constructive Mathematics. Metamathematical Studies, Springer, Berlin (t.a.) (1984a).

    Google Scholar 

  • P. Benacerraf, ‘What numbers could not be’, Philosophical Review 74 (1965), 47–73.

    Google Scholar 

  • G. Birkhoff and S. MacLane, A Survey of Modern Algebra, 4th edn., MacMillan, New York (1977).

    Google Scholar 

  • E. Bishop, Foundations of Constructive Analysis, McGraw Hill, New York (1967).

    Google Scholar 

  • D. S. Bridges, Constructive Functional Analysis, Research Notes in Mathematics 28, Pitman, London (1979).

    Google Scholar 

  • H. B. Enderton, Elements of Set Theory, Academic Press, New York (1977).

    Google Scholar 

  • S. Feferman, ‘Arithmetization of metamathematics in a general setting’, Fundamenta Mathematicae 49 (1960), 35–92.

    Google Scholar 

  • S. Feferman, ‘A language and axioms for explicit mathematics’ in Algebra and Logic, Lecture Notes in Mathematics 450, Springer, Berlin (1975), pp. 87–139.

    Google Scholar 

  • S. Feferman, ‘Recursion theory and set theory: a marriage of convenience’, in Generalized Recursion Theory II, North-Holland, Amsterdam (1978), pp. 55–98.

    Google Scholar 

  • S. Feferman, ‘Constructive theories of functions and classes’, in Logic Colloquium 78, North-Holland, Amsterdam (1979), pp. 159–224.

    Google Scholar 

  • S. Feferman, ‘Inductively presented systems and the formalization of metamathematics’, in Logic Colloquium 80, North-Holland, Amsterdam (1982), pp. 95–128.

    Google Scholar 

  • S. Feferman, ‘Toward useful type-free theories, I’, J. Symbolic Logic 49 (1984), 75–111.

    Google Scholar 

  • S. Feferman, ‘Between constructive and classical mathematics’, in Logic Colloquium 83, Aachen (t.a.) (1984a).

  • H. Friedman, ‘Set theoretic foundations for constructive analysis’, Annals of Mathematics 105 (1977), 1–28.

    Google Scholar 

  • Y. Moschovakis, ‘Intensional semantics of programming languages’ (in preparation).

  • J. Myhill, ‘Constructive set theory’, J. Symbolic Logic 40 (1975), 347–382.

    Google Scholar 

  • D. Prawitz, ‘Ideas and results in proof theory’, in Proc. Second Scandinavian Logic Symposium, North-Holland, Amsterdam (1971), pp. 253–307.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Stanford University, 94305, Stanford, CA, USA

    Solomon Feferman

  2. Department of Philosophy, Stanford University, 94305, Stanford, CA, USA

    Solomon Feferman

Authors
  1. Solomon Feferman
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Feferman, S. Intensionality in mathematics. J Philos Logic 14, 41–55 (1985). https://doi.org/10.1007/BF00542648

Download citation

  • Issue Date:

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

Search

Navigation