Skip to main content
Springer Nature Link
Log in

Reminiscences of logicians

  • 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

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. ACZEL, P. and P.G. HINMAN Recursion in the Superjump, in Generalized Recursion Theory, North-Holland, 1974, 3–42.

    Google Scholar 

  2. ADDISON, J.W. On some points in the theory of recursive functions, Dissertation, University of Wisconsin, Unpublished.

    Google Scholar 

  3. Some consequences of the axiom of constructibility, Fundamenta Math. 46, 337–357.

    Google Scholar 

  4. CHANG, C-C. and H J KEISLER Model Theory, North-Holland, 1973.

    Google Scholar 

  5. CHURCH, A. An unsolvable problem of elementary number theory, American Journal of Math. 58, 345–363, 1936.

    Article  MathSciNet  MATH  Google Scholar 

  6. DAVIS, M The Undecidable, Raven Press, 1965.

    Google Scholar 

  7. FRAENKEL, A.A. Der Begriff "definit" und die Unabhängigkeit des Auswahlaxioms, Sitz. Preuss. Akad. Wiss., Phys.-math. Kl. 253–257. English translation in van Heijenoort, ‘From Frege to Gödel, A source book in mathematical logic, 1879–1931', Harvard Press, 1967.

    Google Scholar 

  8. GÖDEL, K Die Vollständigkeit der Axiome des logischen Funktionenkalküls, Monatshefte für Mathematik und Physik 37, 1930, 349–350. English translation in van Heijenoort [67].

    Article  MATH  Google Scholar 

  9. Über formal unentschiedbare Sätze der Principia Mathematica und verwandter Systeme I, Monatsh. Math. u. Phys. 38, 1931, 173–198. English translation in van Heijenoort [67], 596–617.

    Article  MATH  Google Scholar 

  10. GÖDEL, K. Remarks contributed to a "Diskussion zur Grundlegung der Mathematik", Erkenntnis, vol. 2, 147–148.

    Google Scholar 

  11. On undecidable propositions of formal mathematical systems, Notes by S.C. Kleene and Barkley Rosser on lectures at the Institute for Advanced Study, 1934. Mimeographed, Princeton, N.J. Reprinted in "The Undecidable", 39–74.

    Google Scholar 

  12. Über die Länge von Beweisen, Ergebnisse eines mathematischen Kolloquiums 7, (for 1934–5 publ. 1936, with note added in press), 23–24.

    Google Scholar 

  13. The consistency of the axiom of choice and of the generalized continuum hypothesis, Proc. of the Nat. Acad. of Sciences 24, 556–557, 25, 220–224, 1938.

    Article  MATH  Google Scholar 

  14. Remarks Before the Princeton Bicentennial Conference on Problems in Mathematics, in "The Undecidable", 84–88, 1946.

    Google Scholar 

  15. HILBERT, D. and W. ACKERMANN Grundzüge der theoretischen Logik, Berlin, Springer, 1928.

    MATH  Google Scholar 

  16. HILBERT, D. and P. BERNAYS Grundlagen der Mathematik, Vol.1, Berlin, Springer, 1934.

    MATH  Google Scholar 

  17. Grundlagen der Mathematik, Vol.2, Berlin, Springer, 1939.

    MATH  Google Scholar 

  18. KLEENE, S.C. General recursive functions of natural numbers, Mathematische Annalen 112, 1936, 727–742. For an erratum and a simplification, cf. Jour. Symb. Logic 3, p.152, 2, p.38 and 4, top p.iv at end.

    Article  MathSciNet  MATH  Google Scholar 

  19. Recursive Predicates and Quantifiers, Trans. Am. Math. Soc. 53, 1943, 41–73.

    Article  MathSciNet  MATH  Google Scholar 

  20. A symmetric form of Gödel's theorem, Koninklijke Nederlandsche Akademie van Wetenschappen, Proc.of the section of sciences, vol.53, 1950, 800–802, also in Indagationes mathematicae, vol.12, 244–246.

    MathSciNet  MATH  Google Scholar 

  21. Introduction to Metamathematics, Wolters-Noordhoff and North-Holland, 1952.

    Google Scholar 

  22. Arithmetical Predicates and Function Quantifiers, Trans. Am. Math. Soc. 79, 1955, 312–340.

    Article  MathSciNet  MATH  Google Scholar 

  23. KLEENE, S.C. and E.L. POST The upper semilattice of degrees of unsolvability, Annals of Mathematics 59, 1954, 379–407.

    Article  MathSciNet  MATH  Google Scholar 

  24. KRIPKE, S. Transfinite recursions on admissible ordinals, I, II, Abstract, Jour. Symb. Logic 29, 1964, 161–162.

    Google Scholar 

  25. LANGFORD, C.H. Some theorems on deducibility, Annals of Mathematics 28, 1926, 16–40.

    Article  MathSciNet  MATH  Google Scholar 

  26. Some theorems on deducibility, 2nd paper, ibid. 28, 1927, 459–471.

    Article  MathSciNet  MATH  Google Scholar 

  27. LEWIS, C.I. and C.H. LANGFORD Symbolic Logic, The Century Co., New York and London, 1932.

    MATH  Google Scholar 

  28. LINDENBAUM, A. and A. MOSTOWSKI Über die Unabhängigkeit des Auswahlaxioms und einiger seiner Folgerungen, Comptes Rendus des Séances de la Société des Sciences et des Lettres de Varsovie, Cl. III, 31, 1938, 27–32.

    Google Scholar 

  29. LÖWENHEIM, L. Über Möglichkeiten im Relativkalkül, Math. Ann. 76, 1915, 447–470, English translation in van Heijenoort [67].

    Article  MathSciNet  MATH  Google Scholar 

  30. MACHOVER, M. The theory of transfinite recursion, Bull. Am. Math. Soc. 67, 1961, 575–578.

    Article  MathSciNet  MATH  Google Scholar 

  31. MOSTOWSKI, A. Über den Begriff einer endlichen Menge, Comptes Rendus des Séances de la Société des Sciences et des Lettres de Varsovie, Cl.III, 31, 1938, 13–20.

    Google Scholar 

  32. On definable sets of positive integers, Fundamenta Math. 34, 1947, 81–112.

    MathSciNet  MATH  Google Scholar 

  33. MOSTOWSKI, A. and A. TARSKI Arithmetical classes and types of well ordered systems, Abstract, Bull. Am. Math. Soc. 55, 1949, p.65.

    Google Scholar 

  34. NEWMAN, M. "Alan Mathison Turing, 1912–1954", Biographical Memoirs of Fellows of the Royal Society, Vol.1, 1955, 253–263.

    Article  Google Scholar 

  35. NOVIKOFF, P.S. O néprotivoréčivosti nékotoryh položénij déskriptivnoj teorii množéstv, (On the consistency of some theorems of the descriptive theory of sets), Trudy Matématičeskogo Instituta iméni V.A. Stéklova, Vol.28, 1951, 279–316.

    Google Scholar 

  36. PLATEK, R. A countable hierarchy for the superjump, Logic Colloquium '69, ed. Gandy, Yates (North-Holland), 1971, 257–272.

    Google Scholar 

  37. POST, E.L. Finite combinatory processes — formulation 1, Journal of Symb. Logic 1, 1936, 103–105.

    Article  MATH  Google Scholar 

  38. PRESBURGER, M. Über die Vollständigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt, Sprawodzanie z I Kongresu Matematyków Krajow Słowianskich (Comptes-rendus du I Congrès des Mathématiciens des Pays Slaves), Warsaw 1929, Warsaw 1930, 92–101, 395.

    Google Scholar 

  39. RASIOWA, H. and R. SIKORSKI The mathematics of metamathematics, Warsaw, 1963.

    Google Scholar 

  40. SKOLEM, T. Untersuchungen über die Axiome des Klassenkalküls und über Produktations-und Summationsprobleme, welche gewisse Klassen von Aussagen betreffen, Skrifter utgit av Videnskapsselskapet i Kristiana, I Matematisk — naturvidenskabelig klasse 1919, no.3, 37 pp.

    Google Scholar 

  41. Logisch-kombinatorische Untersuchungen über die Erfüllbarkeit oder Beweisbarkeit mathematischer Sätze nebst einem Theoreme Über dichte Mengen, ibid. no.4, Engl. transl. of §1 in van Heijenoort.

    Google Scholar 

  42. SKOLEM, T. Über die Nichtcharakterisierbarkeit der Zahlenreihe mittels endlich oder abzahlbar unendlichvieler Aussagen mit ausschliesslich Zahlenvariablen, Fundamenta Math. 23, 1934, 150–161.

    MATH  Google Scholar 

  43. TAKEUTI, G. On the theory of ordinal numbers, Journ. Math. Soc. Japan 9, 1955, 93–113.

    Article  MathSciNet  MATH  Google Scholar 

  44. On the recursive functions of ordinal numbers, Journ. Math. Soc. Japan 12, 1960, 119–128.

    Article  MathSciNet  MATH  Google Scholar 

  45. TARSKI, A. See Skolem's 1934 paper. Editor's note 3, p.161.

    Google Scholar 

  46. TARSKI, A. and J.C.C. McKINSEY A Decision Method for Elementary Algebra and Geometry, Berkeley, Los Angeles, 1948.

    Google Scholar 

  47. TURING, A.M. On computable numbers, with an application to the Entscheidungsproblem, Proc. Lond. Math. Soc. ser. 2, vol. 42, 230–265, A correction, ibid. vol. 43, 1937, 544–546.

    Google Scholar 

  48. VAN HEIJENOORT, J. ‘From Frege to Godel, A source book in mathematical logic, 1879–1931', Harvard Press, 1967.

    Google Scholar 

  49. WHITEHEAD, A.N. and B. RUSSELL Principia Mathematica, Vol.1, 1910, Vol.2, 1912, Vol.3, 1913. Cambridge, England (University Press).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Monash University, 3168, Clayton, Victoria, Australia

    J N Crossley

Authors
  1. J N Crossley
    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

Crossley, J.N. (1975). Reminiscences of logicians. In: Crossley, J.N. (eds) Algebra and Logic. Lecture Notes in Mathematics, vol 450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0062850

Download citation

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

  • 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