Skip to main content

Lectures on intuitionism

Intuitionism

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

Keywords

  • Natural Number
  • Intuitionistic Logic
  • Kripke Model
  • Proof Theory
  • Choice Sequence

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.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   54.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   69.95
Price excludes VAT (Canada)
  • 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • P.H.G. Aczel 1968 Satured intuitionistic theories, in Contributions to mathematical logic, ed. Schmidt, Schütte, Thiele, Amsterdam, p. 1–11.

    Google Scholar 

  • Ashwinikumar 1966 Hilbert spaces in intuitionism. Ph.D. Thesis, Amsterdam.

    Google Scholar 

  • 1969 Über katalogisierte Räume, Comp.Math. 21, p.431–456.

    MATH  Google Scholar 

  • E.W.Beth 1952 The Foundations of mathematics. Amsterdam.

    Google Scholar 

  • L.E.J.Brouwer 1908 De onbetrouwbaarheid der logische principes (The untrustworthyness of the logical principles), Tijdschrift voor Wijsbegeerte, p.152–158.

    Google Scholar 

  • 1918 Begründung der Mengenlehre unabhängig vom logischen Satz vom ausgeschlossenen Dritten, I. Proc.Akad.Amsterdam 12, p.3–43.

    MathSciNet  MATH  Google Scholar 

  • 1919 Begründung der Mengenlehre unabhängig vom logisc hen Satz vom ausgeschlossenen Dritten, II. Verhandelingen Akad. Amsterdam 12, p.3–33.

    MathSciNet  Google Scholar 

  • 1920 Besitzt jede reelle Zahl eine Dezimalbruchentwicklung? Proc.Akad.Amsterdam 23, p.955–965.

    MATH  Google Scholar 

  • 1924 Zur Begründung der intuitionistischen Mathematik, I. Math.Ann. 93, p.244–258.

    CrossRef  MathSciNet  MATH  Google Scholar 

  • 1924 Beweiss dasz jede volle Funktion gleichmässig stetig ist. Proc.Akad.Amsterdam 27, p.89–194.

    Google Scholar 

  • 1948 Consciousness philosophy and mathematics, Proc.Xth intern. Congress Phil. Amsterdam, p.1235–1249.

    Google Scholar 

  • 1954 Points and Spaces, Can.J.Math. 6, p.1–17.

    CrossRef  MathSciNet  MATH  Google Scholar 

  • D. van Dalen, C.E. Gordon 1971 Independence problems in subsystems of intuitionistic arithmetic. Indag.Math. 33, p.448–456.

    CrossRef  MathSciNet  MATH  Google Scholar 

  • D. van Dalen, A.S. Troelstra, 1970 Projections of lawless sequences, in Intuitionism and Proof Theory, ed. Kino, Myhill, Vesley. Amsterdam, p.163–186.

    Google Scholar 

  • J.E. Fenstad 1971 (ed). Proceedings of the Second Scandinavian Logic Symposium, Oslo. Amsterdam.

    Google Scholar 

  • M.C.Fitting 1969 Intuitionistic Logic Model Theory and Forcing. Amsterdam.

    Google Scholar 

  • H. Freudenthal 1936 Zum intuitionistischen Raumbegriff. Comp.Math. 4, p.82–111.

    MathSciNet  MATH  Google Scholar 

  • A.O.Gelfond Transcendental and Algebraic numbers. Dover Publications.

    Google Scholar 

  • N.D.Goodman 1968 Intuitionistic arithmetic as a theory of constructions. Ph.D.Thesis Stanford.

    Google Scholar 

  • 1970 A theory of constructions equivalent to arithmetic, in Intuitionism and Proof Theory, ed. Kino, Myhill, Vesley, Amsterdam, p.101–120.

    Google Scholar 

  • A. Grzegorczyk 1964 A philosophically plausible formal interpretation of intuitionistic logic, Indag.Math. 26, p.596–601

    CrossRef  MathSciNet  MATH  Google Scholar 

  • 1964A Recursive objects in all finite types. Fund.Math. 54, p.73–93.

    MathSciNet  MATH  Google Scholar 

  • R. Harrop 1956 On disjunctions and existential statements in intuitionistic systems of logic. Math.Ann. 132, p.347–361.

    CrossRef  MathSciNet  MATH  Google Scholar 

  • J.van Heyenoort 1967 From Frege to Gödel, Cambridge, Mass.

    Google Scholar 

  • A. Heyting 1930 Die formale Regeln der intuitionistischen Logik. Sitzungsber.preuss.Akad.Wiss. Berlin, p.42–56.

    MATH  Google Scholar 

  • 1930A Die formale Regeln der intuitionistischen Mathematik. Sitzungsber.preuss.Akad.Wiss. Berlin, p.57–71.

    MATH  Google Scholar 

  • 1931 Die intuitionistische Grundlegung der Mathematik, Erkenntnis, 2. p.106–115.

    CrossRef  MATH  Google Scholar 

  • 1953 Inleiding tot de Intuitionistische Wiskunde (mimeographed), with cooperation of J.J.de Iongh, Amsterdam.

    Google Scholar 

  • 1955 Les fondements des mathématiques. Intuitionisme. Théorie de la démonstration, Paris, Louvain.

    Google Scholar 

  • 1956 Intuitionism, An introduction. Amsterdam.

    Google Scholar 

  • W.A. Howard, G. Kreisel 1966 Transfinite induction and bar induction of types zero and one, and the role of continuity in intuitionistic analysis. J.S.L. 31, p.325–358.

    MathSciNet  MATH  Google Scholar 

  • S. Jaśkowski 1936 Recherches sur le système de la logique intuitioniste. Actes du Congrès Intern Phil.Sc.VI Phil math. Paris,p.58–61.

    Google Scholar 

  • D.H.J.de Jongh A A characterization of the intuitionistic propositional calculus, to appear.

    Google Scholar 

  • S.C.Kleene 1952 Introduction to Metamathematics, Amsterdam-New York.

    Google Scholar 

  • 1959 Countable Functionals, in Constructivity in Mathematics (ed.A.Heyting), p.81–100.

    Google Scholar 

  • 1959A Recursive Functionals and Quantifiers of Finite Types, I, Trans.Am.Math.Soc. 91, p.1–52.

    MathSciNet  MATH  Google Scholar 

  • 1962 Disjunction and existence under implication in elementary intuitionistic formalisms. J.S.L., 27, p.11–18.

    MathSciNet  MATH  Google Scholar 

  • S.C.Kleene, R.E.Vesley 1965 The foundations of intuitionistic mathematics. Amsterdam.

    Google Scholar 

  • A. Kolmogoroff 1932 Zur Deutung der intuitionistischen Logik. Math.Zeitschrift 35, p.58–65.

    CrossRef  MathSciNet  MATH  Google Scholar 

  • G. Kreisel 1958 A remark on free choice sequences and the topological completeness proofs. J.S.L. 23, p.369–388.

    MathSciNet  MATH  Google Scholar 

  • 1958A Elementary completeness properties of intuitionistic logic with a note on negations of prenex formulae. J.S.L.23

    Google Scholar 

  • 1959 Interpretation of Analysis by means of constructive functionals of finite type, in Constructivity in Mathematics (ed.A.Heyting) Amsterdam, p.101–128.

    Google Scholar 

  • 1962 On weak completeness of intuitionistic predicate logic. J.S.L. 27, p.139–158.

    MathSciNet  MATH  Google Scholar 

  • 1962A Foundations of intuitionistic logic, in Logic, methodology and philosophy of science. Stanford, p.198–210.

    Google Scholar 

  • 1963 Stanford report on the foundations of mathematics (mimeographed), Stanford.

    Google Scholar 

  • 1965 Mathematical Logic, in Lectures on modern mathematics, p.95–195, ed. T.L.Saaty.

    Google Scholar 

  • 1968 Lawless sequences of natural numbers, Comp.Math. 20, p.222–248.

    MathSciNet  MATH  Google Scholar 

  • 1970 Church's thesis: a kind of reducibility axiom of constructive matheamtics, in Intuitionism and Proof Theory ed. Kino, Myhill, Vesley. Amsterdam, p.121–150.

    Google Scholar 

  • 1971 A survey of proof theory II in [Fenstad, 71].

    Google Scholar 

  • G.Kreisel, M.H.A.Newman 1970 L.E.J.Brouwer, Biographical Memoir, Royal Society

    Google Scholar 

  • G. Kreisel, A.S. Troelstra 1970 Formal systems for some branches of intuitionistic analysis. Annals of math.logic 1, p.229–387.

    CrossRef  MathSciNet  MATH  Google Scholar 

  • S.Kripke 1965 Semantic analysis of intuitionistic logic I, in Formal systems and recursive functions. ed.Crossley and Dummett. Amsterdam, p.92–130.

    Google Scholar 

  • H. Läuchli 1970 An abstract notion of realizability for which intuitionistic predicate calculus is complete, in Intuitionism and Proof Theory, ed. Kino, Myhill, Vesley, Amsterdam, p.227–234.

    Google Scholar 

  • P.Martin-Löf 1971 Hauptsatz for the intuitionistic theory of iterated inductive definitions, in [Fenstad, 71].

    Google Scholar 

  • 1971A Hauptsatz for the intuitionistic theory of species, in [Fenstad, 71].

    Google Scholar 

  • J. Myhill 1967 Notes toward a formalization of intuitionistic analysis. Logique et Analyse 35, p.280–297.

    MathSciNet  MATH  Google Scholar 

  • H.Osswald A Homomorphie-invariante Formeln in der Kripke-Semantik (forthcoming).

    Google Scholar 

  • B Unterstruktur-invariante Formeln in der Kripke-Semantik (forthcoming).

    Google Scholar 

  • D.Prawitz 1965 Natural Deduction. Stockholm.

    Google Scholar 

  • 1971 Ideas and results in proof theory, in [Fenstad, 71].

    Google Scholar 

  • D. Prawitz, P.E. Malmnäs 1968 A survey of some connections between classical, intuitionistic and minimal logic, in Contributions to mathematical logic, ed. Schmidt, Schütte, Thiele. Amsterdam, p.215–228.

    Google Scholar 

  • H.Rasiowa, R.Sikorski 1963 The mathematics of metamathematics, Warsaw.

    Google Scholar 

  • H.Rogers, Jr. 1967 Theory of recursive functions and effective computability. New York.

    Google Scholar 

  • G.F. Rose 1953 Propositional calculus and realizability. Trans.Am.Math.Soc. 75, p.1–19.

    CrossRef  MathSciNet  MATH  Google Scholar 

  • K.Schütte 1968 Vollständige Systeme modaler und intuitionistischer Logik. Berlin.

    Google Scholar 

  • D.Scott 1960 Completeness proofs for the intuitionistic sentential calculus, in Summaries of talks presented at the Summer Institute of Symbolic Logic in 1957 at Cornell University Princeton, N.J.

    Google Scholar 

  • J.R.Shoenfield 1967 Mathematic Logic. Reading, Mass.

    Google Scholar 

  • C.S.Smorynski 1970 Three papers on Intuitionistic Arithmetic. Stanford Studies in Logic, no.2

    Google Scholar 

  • C.Spector 1962 Provably recursive functionals of analysis; a consistency proof of analysis by an extension of principles formulated in current intuitionistic mathematics, in Recursive function theory. Proc.Symp.Pure Mathematics, p.1–27.

    Google Scholar 

  • W.P.van Stigt 1971 Brouwer's Intuitionism; a reappraisal of Brouwer's contribution to the study of the foundations of mathematics. Ph.D. Thesis. London.

    Google Scholar 

  • M.E.Szabo 1969 The collected Papers of Gerhard Gentzen, Amsterdam.

    Google Scholar 

  • W.W. Tait 1967 Intensional interpretations of functionals of finite type I. J.S.L. 32, p.198–212.

    MathSciNet  MATH  Google Scholar 

  • R.H. Thomason 1968 On the strong semantical completeness of the intuitionistic predicate calculus. J.S.L. 33, p.1–7.

    MathSciNet  MATH  Google Scholar 

  • A.S.Troelstra 1966 Intuitionistic general topology, Ph.D.Thesis, Amsterdam.

    Google Scholar 

  • 1967 Finite and infinite in intuitionistic mathematics. Comp. Math. 18, p.94–116.

    MathSciNet  MATH  Google Scholar 

  • 1968 The theory of choice sequences, in Logic, Methodology and Phil. Science III, ed. van Rootselaar, Staal. Amsterdam, p.201–226.

    Google Scholar 

  • 1969 Informal theory of choice sequences. Studia logica 15, p.31–52.

    CrossRef  MathSciNet  MATH  Google Scholar 

  • 1969A Principles of Intuitionism. Lecture Notes in Mathematics 95, Berlin.

    Google Scholar 

  • 1969B Notes on the intuitionistic theory of sequences (I). Indag.Math. 31, p.430–440.

    MathSciNet  MATH  Google Scholar 

  • 1970 Ibid.. Indag.Math. 32, p.245–252

    CrossRef  MathSciNet  MATH  Google Scholar 

  • 1971 Notions of realizability for intuitionistic arithmetic in all finite types, in [Fenstad, 71].

    Google Scholar 

  • 1971A Computability of terms and notions of realizability for intuitionstic analysis. Report 71-02, Dept. of Math. University of Amsterdam.

    Google Scholar 

  • 1971B An addendum. Annals of Math.Logic, 3.

    Google Scholar 

  • A.S.Yessenin-Volpin 1959 Le programme ultra-intuitioniste des fondements des mathématiques, in Infinistic Methods, Warsaw, p.201–223.

    Google Scholar 

  • 1970 The ultra-intuitionistic criticism and the anti-traditional program for foundations of mathematics, in Intuitionism and Proof theory, p.3–46 ed.Kino, Myhill, Vesley.

    Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1973 Springer-Verlag

About this paper

Cite this paper

van Dalen, D. (1973). Lectures on intuitionism. In: Mathias, A.R.D., Rogers, H. (eds) Cambridge Summer School in Mathematical Logic. Lecture Notes in Mathematics, vol 337. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0066771

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-05569-3

  • Online ISBN: 978-3-540-36884-7

  • eBook Packages: Springer Book Archive