Book contents
- Frontmatter
- Preface
- Contents
- TUTORIALS
- ARTICLES
- Modified bar recursion and classical dependent choice
- Choice and uniformity in weak applicative theories
- Compactness and incompactness phenomena in set theory
- Selection for Borel relations
- Interpolation in goal-directed proof systems 1
- Sequences of degrees associated with models of arithmetic
- The limit theory of generic polynomials
- Moschovakis's notion of meaning as applied to linguistics
- Tameness in expansions of the real field
- The model theory of compact complex spaces
- “Natural” representations and extensions of Gödel's second theorem 350
- Effective Hausdorff dimension
- Mutual stationarity in the coremodel
- The pair (Nn, N0) may fail N0-compactness
- Incompleteness theoremand its frontier
- Groups in Simple Theories
- References
“Natural” representations and extensions of Gödel's second theorem 350
from ARTICLES
Published online by Cambridge University Press: 31 March 2017
Book contents
- Frontmatter
- Preface
- Contents
- TUTORIALS
- ARTICLES
- Modified bar recursion and classical dependent choice
- Choice and uniformity in weak applicative theories
- Compactness and incompactness phenomena in set theory
- Selection for Borel relations
- Interpolation in goal-directed proof systems 1
- Sequences of degrees associated with models of arithmetic
- The limit theory of generic polynomials
- Moschovakis's notion of meaning as applied to linguistics
- Tameness in expansions of the real field
- The model theory of compact complex spaces
- “Natural” representations and extensions of Gödel's second theorem 350
- Effective Hausdorff dimension
- Mutual stationarity in the coremodel
- The pair (Nn, N0) may fail N0-compactness
- Incompleteness theoremand its frontier
- Groups in Simple Theories
- References
- Type
- Chapter
- Information
- Logic Colloquium '01 , pp. 350 - 368Publisher: Cambridge University PressPrint publication year: 2005
References
[1] , Arithmetization of metamathematics in a general setting, Fundamenta Mathematicae, vol. 49 (1960), pp. 35–92.Google Scholar
[2] , Transfinite recursive progressions of axiomatic theories, The Journal of Symbolic Logic, vol. 27 (1962), pp. 259–316.Google Scholar
[3] , , and , The classical and the _- complete arithmetic, The Journal of Symbolic Logic, vol. 23 (1958), pp. 188–206.Google Scholar
[4] and , Metamathematics of First-Order Arithmetic, Springer, Berlin, 1993.
[5] , Models of Peano Arithmetic, Clarendon Press, Oxford, 1991.
[6] , Aspects of Incompleteness, Springer, Berlin, 1997.
[7] , ü ber die unendliche Induktion, Infinitistic Methods, Pergamon Press, Oxford, London, NY, Paris, 1961, pp. 75–95.
[8] , ZurMetamathematik nichtaxiomatisierbarer Theorien, CIS, ünchen, 1996.
[9] , On the limits of Gödel's second incompleteness theorem, Argument und Analyse. Proceedings of GAP4 ( and , editors),Mentis, 2002, pp. 109–136.Google Scholar
[10] , The incompleteness theorems, Handbook of mathematical logic (, editor), North-Holland, 1977, pp. 821–865.
[11] , Self-reference and Modal Logic, Springer, Berlin, 1985.
[12] , , and , Undecidable Theories, North-Holland, Amsterdam, 1953.
[13] , The formalization of interpretability, Studia Logica, vol. 50 (1991), pp. 81–105.Google Scholar
[14] , Self-verifying axiom systems, the incompleteness theorem and related reflection principles, The Journal of Symbolic Logic, vol. 66 (2001), pp. 536–596.Google Scholar