Skip to main content
SpringerLink
Log in

Working foundations

  • Published:
Synthese 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.

Institutional subscriptions

Bibliography

  • Aberth, O.: 1980, Computable Analysis, McGraw-Hill.

  • Aczel, P.: 1977, ‘An introduction to inductive definitions’, in Barwise 1977, pp. 739–782.

  • Ax, J. and S. Kochen: 1965, ‘Diophantine problems over local fields II’, Amer. J. Math. 87, 605–630.

    Google Scholar 

  • Barendregt, H.: 1977, ‘The type free lambda calculus’, in Barwise 1977, pp. 1091–1132.

  • Barendregt, H.: 1981, The Lambda Calculus: Its Syntax and Semantics, North-Holland, Amsterdam.

    Google Scholar 

  • Barwise, J. (ed.): 1977, Handbook of Mathematical Logic, North-Holland, Amsterdam.

    Google Scholar 

  • Beeson, M.: 1980, ‘Extensionality and choice in constructive mathematics’, Pacific J. Maths. 88, 1–28.

    Google Scholar 

  • Beeson, M.: 1981, ‘Formalizing constructive mathematics: why and how?’, in Lecture Notes in Maths. 873, 146–190.

    Google Scholar 

  • Beeson, M.: 1982, ‘Problematic principles in constructive mathematics’, in Logic Colloquium 1980, North-Holland, Amsterdam, pp. 11–55.

    Google Scholar 

  • Beeson, M.: 1985, Foundations of Constructive Mathematics: Metamathematical Studies, Springer (to appear).

  • Bishop, E.: 1967, Foundations of Constructive Analysis, McGraw-Hill.

  • Bishop, E. and H. Cheng: 1972, ‘Constructive measure theory’, A.M.S. Memoirs No. 116.

  • Troelstra, A. S.: 1977, ‘Aspects of constructive mathematics’, in Barwise 1977, pp. 973–1052.

  • Wang, H.: 1974, From Mathematics to Philosophy, Routledge & Kegan Paul, London.

    Google Scholar 

  • Weyl, H. 1918, Das Kontinuum, Veit.

  • Bridges, D.: 1979, Constructive Functional Analysis, Pitman.

  • Brouwer, L. E. J.: 1975, Collected Works, I. North-Holland, Amsterdam.

    Google Scholar 

  • Buchholz, W., S. Feferman, W. Pohlers, and W. Sieg: 1981, ‘Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies’, Lecture Notes in Maths. 897, 383.

    Google Scholar 

  • Cherlin, G.: 1976, ‘Model theoretic algebra: selected topics’, Lecture Notes in Maths. 521, 234.

    Google Scholar 

  • Cohen, P. J.: 1966, Set theory and the Continuum Hypothesis, Benjamin.

  • Cohen, P. J.: 1969, ‘Decision procedures for real and p-adic fields’, Comm. Symp. Pure Appl. Math. 22, 131–151.

    Google Scholar 

  • Davis, P. J. and R. Hersh: 1981, The Mathematical Experience, Birkhäuser.

  • Dreben, B. and J. Denton: 1966, ‘A supplement to Herbrand’, J. Symbolic Logic 31, 393–398.

    Google Scholar 

  • Feferman, S.: 1968, ‘Systems of predicative analysis II. Representations of ordinals’, J. Symbolic Logic 33, 193–220.

    Google Scholar 

  • Feferman, S.: 1968a, ‘Autonomous transfinite progressions and the extent of predicative mathematics’, in Logic, Methodology and Philosophy of Science. III, North-Holland, Amsterdam, pp. 121–135.

    Google Scholar 

  • Feferman, S.: 1969, ‘Set-theoretical foundations of category theory’ (with an Appendix by G. Kreisel), in Lecture Notes in Maths. 106, 201–247.

    Google Scholar 

  • Feferman, S.: 1970, ‘Formal theories for transfinite iterations of generalized inductive definitions and some subsystems of analysis’, in Intuitionism and Proof Theory, pp. 303–326.

  • Feferman, S.: 1972, ‘Infinitary properties, local functors, and systems of ordinal functions’, in Lecture Notes in Maths. 255, 63–97.

    Google Scholar 

  • Feferman, S.: 1975, ‘A language and axioms for explicit mathematics’, in Lecture Notes in Maths. 450, 87–139.

    Google Scholar 

  • Feferman, S.: 1977, ‘Theories of finite type related to mathematical practice’, in Barwise 1977, pp. 913–971.

  • Feferman, S.: 1977a, ‘Inductive schemata and recursively continuous functionals’, in Logic Colloquium, North-Holland, Amsterdam, pp. 373–392.

    Google Scholar 

  • Feferman, S.: 1977b, ‘Categorical foundations and foundations of category theory’, in Logic, Foundations of Mathematics and Computability Theory, Reidel, Dordrecht, pp. 149–169.

    Google Scholar 

  • Feferman, S.: 1978, ‘A more perspicuous formal system for predicativity’, in Konstruktionen versus Positionen I, Walter de Gruyter, pp. 87–139.

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

    Google Scholar 

  • Feferman, S.: 1979a, ‘What does logic have to tell us about mathematical proofs?’, The Mathematical Intelligencer 2, 20–24.

    Google Scholar 

  • Feferman, S.: 1981, ‘The logic of mathematical discovery vs. the logical structure of mathematics’, in PSA, 2, 309–327. (Phil. of Science Assoc.).

    Google Scholar 

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

    Google Scholar 

  • Feferman, S.: 1982a, ‘Monotone inductive definitions’, in The L.E.J. Brouwer Centenary Symposium, North-Holland, Amsterdam, pp. 77–89.

    Google Scholar 

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

    Google Scholar 

  • Fenstad, J. E.: 1980, General Recursion Theory. An axiomatic approach, Springer.

  • Fitting, M. C.: 1981, Fundamentals of Generalized Recursion Theory, North-Holland, Amsterdam.

    Google Scholar 

  • Friedman, H.: 1971, ‘Algorithmic procedures, generalized Turing algorithms and elementary recursion theories’, in Logic Colloquium, 1969, North-Holland, Amsterdam, pp. 361–390.

    Google Scholar 

  • Friedman, H.: 1975, ‘Some systems of second order arithmetic and their use’, Proc. Int. Cong. Maths., 1974, 1, 235–242.

    Google Scholar 

  • Friedman, H.: 1976, ‘Systems of second order arithmetic with restricted induction’ (abstracts), J. Symbolic Logic 41, 557–559.

    Google Scholar 

  • Friedman, H.: 1977, ‘Set-theoretic foundations for constructive analysis’, Annals of Math. 105, 1–28.

    Google Scholar 

  • Friedman, H. 1980, ‘A strong conservative extension of Peano arithmetic’, The Kleene Symposium, North-Holland, Amsterdam, pp. 113–122.

    Google Scholar 

  • Friedman, H., K. McAloon, and S. G. Simpson: 1982, ‘A finite combinatorial principle which is equivalent to the 1-consistency of predicative analysis’, in Patras Logic Symposium, North-Holland, pp. 197–230.

  • Friedman, H., S. G. Simpson, and R. Smith: 1983, ‘Countable algebra and set existence axioms’, Annals of Pure and Applied Logic 25, 141–181.

    Google Scholar 

  • Gentzen, G.: 1969, The Collected Papers of Gerhard Gentzen, North-Holland, Amsterdam.

    Google Scholar 

  • Girard, J.-Y.: 1981, ‘∏ 21 -logic, Part I: Dilators’, Annals of Math. Logic 21, 75–219.

    Google Scholar 

  • Gödel, K.: 1959, ‘Consistency-proof for the generalized continuum-hypothesis’, Proc. Nat. Acad. Sci. U.S.A. 25, 220–224.

    Google Scholar 

  • Gödel, K.: 1940, ‘The consistency of the continuum hypothesis’, Ann. Math. Studies No. 3, The Princeton Univ. Press; rev., notes added 1951, 1966.

  • Gödel, K.: 1958, ‘Über eine bisher noch nicht benützte Erweiterung des finiten Standpunktes’, Dialectica 12, 280–287.

    Google Scholar 

  • Goodman, N. D.: 1979, ‘Mathematics as an objective science’, Amer. Math. Monthly 86, 540–551.

    Google Scholar 

  • Hersh, R.: 1979, ‘Some proposals for reviving the philosophy of mathematics’, Advances in Mathematics 31, 31–50.

    Google Scholar 

  • Hilbert, D. and P. Bernays: 1959, ‘Grundlagen der Mathematik II’, Springer; rev. edn. 1970.

  • Jäger, G. and W. Pohlers: 1982, ‘Eine beweistheoretische Untersuchung von (δ 21 − CA) + (BI) und verwandter Systeme’, Sitzungsber. Bayer. Akad. Wiss., Mat.-Nat. Klasse, 1–28.

  • Jensen, R.: 1969, ‘On the consistency of a slight(?) modification of Quine's New Foundations’, in Words and Objections: Essays on the Work of W. V. Quine, Reidel, Dordrecht, pp. 278–291.

    Google Scholar 

  • Kanamori, A. and M. Magidor: 1978, ‘The evolution of large cardinal axioms in set theory’, in Lecture Notes in Maths. 669, 99–275.

    Google Scholar 

  • Kleene, S. C. and R. E. Vesley: 1965, The Foundations of intuitionistic mathematics, especially in relation to recursive functions, North-Holland, Amsterdam.

    Google Scholar 

  • Kreisel, G.: 1958, ‘Mathematical significance of consistency proofs’, J. Symbolic Logic 23, 155–182.

    Google Scholar 

  • Kreisel, G.: 1967, ‘Mathematical logic: what has it done for the philosophy of mathematics’, in Bertrand Russell, Philosopher of the Century, Allen and Unwin, pp. 201–272.

  • Kreisel, G.: 1970, ‘Principles of proof and ordinals implicit in given concepts’, in Intuitionism and Proof Theory, North-Holland, Amsterdam, pp. 489–516.

    Google Scholar 

  • Kreisel, G.: 1976, ‘What have we learned from Hilbert's second problem?’, Proc. Sympos. Pure Math. XXVIII, (A.M.S.) 93–130.

    Google Scholar 

  • Kreisel, G.: 1977, ‘Review of Brouwer 1975’, Bull. A.M.S. 83, 86–93.

    Google Scholar 

  • Kreisel, G. and A. S. Troelstra: 1970, ‘Formal systems for some branches of intuitionistic analysis’, Annals Math. Logic 1, 229–387.

    Google Scholar 

  • Lakatos, I.: 1976, Proofs and Refutations: the Logic of Mathematical Discovery, Cambridge University Press.

  • Lakatos, I.: 1978, Mathematics, Science and Epistemology: Philosophical Papers vol. 2, Cambridge University Press.

  • MacLane, S.: 1961, ‘Locally small categories and the foundations of mathematics’, in Infinitistic Methods, Pergamon, pp. 25–43.

  • MacLane, S.: 1971, Categories for the Working Mathematician, Springer.

  • MacLane, S.: 1981, ‘Mathematical models: a sketch for the philosophy of mathematics’, Amer. Math. Monthly 88, 462–72.

    Google Scholar 

  • Martin-Löf, P.: 1982, ‘Constructive mathematics and computer programming’, Logic, Methodology and Philosophy of Science VI, North-Holland, Amsterdam.

    Google Scholar 

  • Mines, R. and F. Richman: 1981, ‘Dedekind domains’, in Lecture Notes in Maths. 873, 16–30.

    Google Scholar 

  • Moore, G.: 1982, Zermelo's Axiom of Choice, Springer.

  • Moschovakis, Y. N.: 1977, ‘On the basic notions in the theory of induction’, in Logic, Foundations of Mathematics, and Computability Theory, Reidel, Dordrecht, pp. 207–236.

    Google Scholar 

  • Myhill, J.: 1975, ‘Constructive set theory’, J. Symbolic Logic 40, 347–383.

    Google Scholar 

  • Paris, J. and L. Harrington: 1977, ‘A mathematical incompleteness in Peano Arithmetic’, in Barwise 1977, pp. 1133–1142.

    Google Scholar 

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

    Google Scholar 

  • Robinson, A.: 1966, Non-Standard Analysis, North-Holland; rev. ed. 1974.

  • Schütte, K.: 1978, Proof Theory, Springer.

  • Scott, D.: 1972, ‘Continuous lattices’, in Lecture Notes in Maths. 274, 97–136.

    Google Scholar 

  • Scott, D.: 1976, ‘Data Types as lattices’, SIAM J. Comput. 5, 522–587.

    Google Scholar 

  • Simpson, S. G.: 1984, ‘Which set existence axioms are needed to prove the Cauchy/Peano theorem for ordinary differential equations?’, J. Symbolic Logic 49, 783–802.

    Google Scholar 

  • Stoy, J. E.: 1979, Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory, M.I.T. Press.

  • Stroyan, K. D.: 1977, ‘Infinitesimal analysis of curves and surfaces’, in Barwise 1977, pp. 197–231.

    Google Scholar 

  • Takeuti, G.: 1975, Proof Theory, North-Holland, Amsterdam.

    Google Scholar 

  • Takeuti, G.: 1978, ‘A conservative extension of Peano Arithmetic’, Part II of Two Applications of Logic to Mathematics, Princeton Univ. Press.

  • Troelstra, A. S.: 1977, ‘Aspects of constructive mathematics’, in Barwise 1977, pp. 973–1052.

    Google Scholar 

  • Wang, H.: 1974, From Mathematics to Philosophy, Routledge & Kegan Paul, London.

    Google Scholar 

  • Weyl, H. 1918, Das Kontinuum, Veit.

Download references

Author information

Authors and Affiliations

  1. Depts. of Mathematics and 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

Additional information

This is a greatly modified (and accordingly retitled) from of a paper presented to the workshop ‘The present state of the problem of foundations of mathematics’ arranged by the Florence Center for the History and Philosophy of Science at the Villa di Mondeggi, 15–19 June 1981. I wish to thank the organizers of this conference for all they did to make it a success, both for the individual participants and as a whole.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Feferman, S. Working foundations. Synthese 62, 229–254 (1985). https://doi.org/10.1007/BF00486048

Download citation

  • Issue Date:

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

Search

Navigation