Journal of the Australian Mathematical Society (Series A)
- Journal of the Australian Mathematical Society (Series A) / Volume 24 / Issue 02 / September 1977, pp 139-161
- Copyright © Australian Mathematical Society 1977
- DOI: http://dx.doi.org/10.1017/S1446788700020164 (About DOI), Published online: 09 April 2009
Research Article
Concise survey of mathematical logic
John Stillwella1
a1 Monash University Clayton 3168 Australia
Abstract
This paper contains proofs of the compactness, completeness and Löwenheim-Skolem theorems for predicate logic, together with their application to nonstandard numbers; proofs of undecidability in predicate logic and number theory, and the Gödel incompleteness theorem.
(Received February 02 1976)
Subject classification (Amer. Math. Soc. (MOS), 1970)
- 0202
- Borel, E. (1952), Les Nombres Inaccessibles (Gauthier-Villars). [Google Scholar]
- Church, A. (1936), “A note on the Entscheidungsproblem”, J. Symbolic Logic 1, 40–41. [OpenURL Query Data] [CrossRef] [Google Scholar]
- Crossley, J. and others (1952), What is Mathematical Logic? (Oxford University Press). [Google Scholar]
- Davis, M. (1965), The Undecidable (Raven Press). [Google Scholar]
- Gödel, K. (1930), “Die Vollständigkeit der Axiom des logischen Funktionenkalküls”, Monatsch. Math. Phys. 37, 349–360. [OpenURL Query Data] [CrossRef] [Google Scholar]
- Gödel, K. (1931), “Über formal unentscheidbare Sätze der Principia Mathematica und verwandte Systeme I”, Monatsh. Math. Phys. 38, 173–198. [OpenURL Query Data] [CrossRef] [Google Scholar]
- Herbrand, J. (1930), “Recherches sur la théorie de la demonstration”, Travaux de la Société des Lettres de Varsovie, Classe III, sciences math, et phys., 33. [OpenURL Query Data] [Google Scholar]
- Kleene, S. C. (1958), “Mathematical logic”, Proc. Int. Cong. Math. 1958, 137–153. [OpenURL Query Data] [Google Scholar]
- Löwenheim, L. (1915), “Über Möglichkeiten im Relativkalkül”, Math. Ann. 76, 447–470. [OpenURL Query Data] [CrossRef] [Google Scholar]
- Post, E. (1921), “Introduction to a general theory of elementary propositions”, Amer. J. Math. 43, 163–185. [OpenURL Query Data] [CrossRef] [Google Scholar]
- Post, E. (1944), “Recursively enumerable sets of positive integers and their decision problems”, Bull. Amer. Math. Soc. 50, 284–316. [OpenURL Query Data] [CrossRef] [Google Scholar]
- Post, E. (1947), “Recursive unsolvability of a problem of Thue”, J. Symb. Logic 12, 1–11. [OpenURL Query Data] [CrossRef] [Google Scholar]
- Skolem, T. (1955), Mathematical Interpretation of Formal Systems (North Holland). [Google Scholar]
- Smullyan, R. (1961), Theory of Formal Systems (Princeton University Press). [Google Scholar]
- Turing, A. (1936), “On computable numbers with an application to the Entscheidungs-problem”, Proc. Lond. Math. Soc. (2), 42, 230–265. [OpenURL Query Data] [CrossRef] [Google Scholar]
