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
Selection for Borel relations
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. 151 - 169Publisher: Cambridge University PressPrint publication year: 2005
References
[1] , Admissible sets and structures, Perspectives inMathematical Logic, Springer-Verlag, 1975.
[2] and , Compact covering and game determinacy, Topology and Its Applications, vol. 68 (1996), pp. 153–185.Google Scholar
[3] , Cofinal S11 and subsets of NN, Fundamenta Mathematicae, vol. 159 (1999), pp. 161–193.Google Scholar
[4] , Compact covering mappings and cofinal families of compact subsets of a Borel set, Fundamenta Mathematicae, vol. 167 (2001), pp. 213–249.Google Scholar
[5] , Compact covering mappings between Borel sets and the size of constructible reals, Transactions of the American Mathematical Society, vol. 356 (2004), pp. 73–117.Google Scholar
[6] , Borel liftings of Borel sets: some decidable and undecidable results, http://web. ccr.jussieu.fr/eqanalyse/Users/jsr, to appear as an AMSMemoir.
[7] , The equivalence of determinacy and iterated sharps, The Journal of Symbolic Logic, vol. 55 (1990), pp. 502–525.Google Scholar
[8] , Higher set theory and mathematical practice, Annals of Mathematical Logic, vol. 2 (1971), pp. 326–357.Google Scholar
[9] , On the necessary use of abstract set theory, Advances in Mathematics, vol. 41 (1981), no. 3, pp. 209–280.Google Scholar
[10] , On the existence of certain cofinal subsets of, Proceedings of Symposia in Pure Mathematics, vol. 13, Part II, 1974, pp. 155–173.Google Scholar
[11] , Set theory, Academic Press, 1978.
[12] , Classical descriptive set theory, Graduate Texts inMathematics, Springer-Verlag, 1995.
[13] , A purely inductive proof of Borel determinacy, Proceedings of the AMS Symposium in PureMathematics, Recursion Theory, vol. 42, 1985, pp. 303–308.Google Scholar
[14] , Analytic determinacy and 0#: A forcing-free proof of Harrington's theorem, Fundamenta Mathematicae, vol. 160 (1999), pp. 153–159.Google Scholar
[15] , The problem of predicativity, Essays on the foundations of mathematics ( et al., editor), The Magnes Press, Jerusalem, 1961, pp. 132–142.
[16] , Subsystems of second order arithmetic, Perspectives inMathematical Logic, Springer, 1999.