Skip to main content
SpringerLink
Log in

Realizability: A retrospective survey

  • Intuitionism
  • Conference paper
  • First Online:
Book cover Cambridge Summer School in Mathematical Logic

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

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 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.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

  • CHURCH, ALONZO 1936. An unsolvable problem of elementary number theory. Amer. jour. of math., vol. 58, pp. 345–363.

    Article  MathSciNet  MATH  Google Scholar 

  • HARROP, RONALD 1956. On disjunctions and existential statements in intuitionistic systems of logic. Math. Ann., vol. 132, pp. 347–361.

    Article  MathSciNet  MATH  Google Scholar 

  • 1960. Concerning formulas of the types A→BVC, A→(Ex)B(x) in intuitionistic formal systems. Jour. symbolic logic, vol. 25, pp. 27–32.

    Article  MathSciNet  MATH  Google Scholar 

  • HEYTING, AREND 1930. Die formalen Regeln der intuitionistischen Logik. Sitzungsberichte der Preussischen Akademie der Wissenschaften, Physikalisch-mathematische Klasse, 1930, pp. 42–56.

    Google Scholar 

  • 1930a. Die formalen Regeln der intuitionistischen Mathematik. Ibid., pp. 57–71, 158–169.

    Google Scholar 

  • 1934. Mathematische Grundlagenforschung. Intuitionismus. Beweistheorie. Ergebnisse der Mathematik und ihrer Grenzgebiete, vol. 3, no. 4, Berlin (Springer), pp. iv+73.

    Google Scholar 

  • 1946. On weakened quantification. Jour. symbolic logic, vol. 11, pp. 119–121.

    Article  MathSciNet  MATH  Google Scholar 

  • HILBERT, DAVID and BERNAYS, PAUL 1934. Grundlagen der Mathematik, vol. 1. Berlin (Springer), xii+471 pp.

    MATH  Google Scholar 

  • JONGH, DICK H. J. de 1970. A characterization of the intuitionistic propositional calculus. Intuitionism and proof theory, proceedings of the summer conference at Buffalo, N. Y., 1968, ed. A. Kino, J. Myhill, R. E. Vesley, Amsterdam and London (North-Holland Pub. Co.) 1970, pp. 211–217.

    Google Scholar 

  • KLEENE, STEPHEN COLE 1938. On notation for ordinal numbers. Jour. symbolic logic, vol. 3, pp. 150–155.

    Article  MATH  Google Scholar 

  • 1943. Recursive predicates and quantifiers. Trans. Amer. Math. Soc., vol. 53, pp. 41–73.

    Article  MathSciNet  MATH  Google Scholar 

  • 1945. On the interpretation of intuitionistic number theory. Jour. symbolic logic, vol. 10, pp. 109–124.

    Article  MathSciNet  MATH  Google Scholar 

  • 1948. On the intuitionistic logic. Proceedings of the Tenth International Congress of Philosophy (Amsterdam, Aug. 11–18, 1948), Amsterdam (North-Holland Pub. Co.) 1949, pp. 741–743 (fasc. 2).

    Google Scholar 

  • 1950a. Recursive functions and intuitionistic mathematics. Proceedings of the International Congress of Mathematicians (Cambridge, Mass., U.S.A., Aug. 30–Sept. 6, 1950), 1952, vol. 1, pp. 679–685.

    Google Scholar 

  • 1952b. IM. Introduction to metamathematics. Amsterdam (North-Holland Pub. Co.), Groningen (Noordhoff), New York and Toronto (Van Nostrand), X+550 pp. Sixth reprint, Amsterdam (North-Holland Pub. Co.), Groningen (Wolters-Noordhoff Pub.), New York (American Elsevier Pub. Co.) 1971.

    MATH  Google Scholar 

  • 1957. Realizability. Summaries of talks presented at the Summer Institute of Symbolic Logic in 1957 at Cornell University, vol. 1, pp. 100–104. Reprinted in Constructivity in mathematics, Amsterdam (North-Holland Pub. Co.) 1959, pp. 285–289.

    MATH  Google Scholar 

  • 1959a. Countable functionals. Constructivity in mathematics, Amsterdam (North-Holland Pub. Co.), pp. 81–100.

    Google Scholar 

  • 1960. Realizability and Shanin's algorithm for the constructive deciphering of mathematical sentences. Logique et analyse, 3e Année, Oct. 1960, 11–12, pp. 154–165.

    Google Scholar 

  • 1962a. Disjunction and existence under implication in elementary intuitionistic formalisms. Jour. symbolic logic, vol. 27, pp. 11–18. An addendum, ibid., vol. 28 (1963), pp. 154–156.

    Article  MathSciNet  MATH  Google Scholar 

  • 1964a. Classical extensions of intuitionistic mathematics. Logic, methodology and philosophy of science, proceedings of the 1964 international congress (held at Jerusalem Aug. 26–Sept. 2), ed. Yehoshua Bar-Hillel, Amsterdam (North-Holland Pub. Co.) 1965, pp. 31–44.

    Google Scholar 

  • 1967. Mathematical logic. New York, London, Sydney (John Wiley & Sons), xiii+398 pp.

    MATH  Google Scholar 

  • 1967a. Constructive functions in "The foundations of intuitionistic mathematics". Logic, methodology and philosophy of science III, proceedings of the Third International Congress for L., M. and P. of S., Amsterdam (Aug. 25–Sept. 2) 1967, ed. B. van Rootselaar and J. F. Staal, Amsterdam (North-Holland Pub. Co.) 1968, pp. 137–144.

    Google Scholar 

  • 1969. Formalized recursive functionals and formalized realizability. Memoirs Amer. Math. Soc., no. 89, 106 pp.

    Google Scholar 

  • KLEENE, STEPHEN COLE and VESLEY, RICHARD EUGENE 1965 FIM. The foundations of intuitionistic mathematics, expecially in relation to recursive functions. Amsterdam (North-Holland Pub. Co.), VIII+206 pp.

    MATH  Google Scholar 

  • KOLMOGOROFF, A. N. (KOLMOGOROV, A. N.) 1932. Zur Deutung der intuitionistischen Logik. Math. Zeitschr., vol. 35, pp. 58–65.

    Article  MathSciNet  MATH  Google Scholar 

  • KREISEL, GEORG and PUTNAM, HILARY 1957. Eine Unableitbarkeitsbeweismethode für den intuitionistischen Aussagenkalkül. Archiv für mathematische Logik und Grundlagenforschung, vol. 3, nos. 3–4, pp. 74–78.

    Article  MathSciNet  MATH  Google Scholar 

  • ŁUKASIEWICZ, JAN 1952. On the intuitionistic theory of deduction. Koninklijke Nederlandsche Akademie van Wetenschappen (Amsterdam), Proceedings, series A, vol. 55 (or Indagationes mathematicae, vol. 14), pp. 202–212.

    Google Scholar 

  • MOSCHOVAKIS, JOAN RAND 1967. Disjunction and existence in formalized intuitionistic analysis. Sets, models and recursion theory, Proceedings of the Summer School in Mathematical Logic and Tenth Logic Colloquium, Leicester, Aug.–Sept. 1965, ed. John R. Crossley, Amsterdam (North-Holland Pub. Co.) 1967, pp. 309–331.

    Chapter  Google Scholar 

  • NELSON, DAVID 1947. Recursive functions and intuitionistic number theory. Trans. Amer. Math. Soc., vol. 61, pp. 307–368.

    Article  MathSciNet  MATH  Google Scholar 

  • ROSE, GENE F. 1953. Propositional calculus and realizability. Trans. Amer. Math. Soc., vol. 75, pp. 1–19.

    Article  MathSciNet  MATH  Google Scholar 

  • SHANIN, N. A. (ŠANIN, N. A.) 1958a. Ob algorifme konstruktivnoi rasšifrovki matematičeskih suždenii (Über einen Algorithmus zur konstruktiven Dechiffrierung mathematischer Urteile). Zeitschr. für math. Logik und Grundlagen der Math., vol. 4, pp. 293–303.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The University of Wisconsin, Madison

    S. C. Kleene

Authors
  1. S. C. Kleene
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

A. R. D. Mathias H. Rogers

Rights and permissions

Reprints and permissions

Copyright information

© 1973 Springer-Verlag

About this paper

Cite this paper

Kleene, S.C. (1973). Realizability: A retrospective survey. 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/BFb0066772

Download citation

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

  • 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

Publish with us

Policies and ethics

Search

Navigation