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
Sequences of degrees associated with models of arithmetic
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. 217 - 241Publisher: Cambridge University PressPrint publication year: 2005
References
[1] , Solovay's Theorem cannot be simplified, Annals of Pure and Applied Logic, vol. 112 (2001), pp. 27–41.Google Scholar
[2] , Recursive labeling systems and stability of recursive structures in hyperarithmetical degrees, Transactions of the American Mathematical Society, vol. 298 (1986), pp. 497–514, Corrections, ibid, vol. 310 (1988), p. 851.Google Scholar
[3] and , Ramified systems, Annals of Pure and Applied Logic, vol. 70 (1994), pp. 205–221.Google Scholar
[4] , Coding a family of sets, Annals of Pure and Applied Logic, vol. 94 (1998), pp. 127–142.Google Scholar
[5] , Computable structures and the hyperarithmetical hierarchy, Elsevier, 2000.
[6] , , and , Sequences of n-diagrams, The Journal of Symbolic Logic, vol. 67 (2002), pp. 1227–1247.Google Scholar
[7] , True approximations and models of arithmetic, Models and computability ( and , editors), Cambridge University Press, 1999, pp. 255–278.
[8] , Models of arithmetic: quantifiers and complexity, Reverse mathematics (, editor), Lecture Notes in Logic, vol. 21, AK Peters, to appear.
[9] and , Degrees of recursively saturated models, Transactions of the American Mathematicsl Society, vol. 282 (1984), pp. 539–554.Google Scholar
[10] , Algebras of sets binumerable in complete extensions of arithmetic, Recursive function theory (Dekker, editor), AmericanMathematical Society, 1962, pp. 117–122.