Book contents
- Frontmatter
- Preface
- Plenary sessions
- Special sessions
- Contents
- The Number of Path-Components of a Compact Subset of Rn
- Intervals without Critical Triples
- Beyond Gödel's Theorem: Turing Nonrigidity Revisited
- Types and Indescernibles in Finite Models
- Model Theory of Modules
- Noninterpretability of Infinite Linear Orders
- Combinatorial Principles from Adding Cohen Reals
- Extensions of models of PV
- Convergence Laws for Random Graphs
- V=L and Maximize
- Towards a Categorical Foundation of Mathematics
- Strongly Minimal Sets and Geometry
- Computationally-Sound Proofs
- Lambek Calculus and Formal Languages
- Zil'ber's Trichotomy and o-minimal Structures
- The Higher Infinite in Proof Theory
- There May Be No Nowhere Dense Ultrafilter
- Towards Recursive Model Theory
- Accessible Segments of the Fast Growing Hierarchy
- Author Index
- References
The Number of Path-Components of a Compact Subset of Rn
Published online by Cambridge University Press: 24 March 2017
By
Book contents
- Frontmatter
- Preface
- Plenary sessions
- Special sessions
- Contents
- The Number of Path-Components of a Compact Subset of Rn
- Intervals without Critical Triples
- Beyond Gödel's Theorem: Turing Nonrigidity Revisited
- Types and Indescernibles in Finite Models
- Model Theory of Modules
- Noninterpretability of Infinite Linear Orders
- Combinatorial Principles from Adding Cohen Reals
- Extensions of models of PV
- Convergence Laws for Random Graphs
- V=L and Maximize
- Towards a Categorical Foundation of Mathematics
- Strongly Minimal Sets and Geometry
- Computationally-Sound Proofs
- Lambek Calculus and Formal Languages
- Zil'ber's Trichotomy and o-minimal Structures
- The Higher Infinite in Proof Theory
- There May Be No Nowhere Dense Ultrafilter
- Towards Recursive Model Theory
- Accessible Segments of the Fast Growing Hierarchy
- Author Index
- References
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- Logic Colloquium '95 , pp. 1 - 16Publisher: Cambridge University PressPrint publication year: 2017
References
Some theorems and questions about some natural examples in descriptive set theory Xeroxed Notes, 1984
Descriptive set theoretic phenomena in analysis and topology
Set Theory of the Continuum (
and eds.) Springer-Verlag, 1992, pp. 1-25.
Path-connectedness, simple connectedness and descriptive set theory, info in preparation.
and
The Descriptive Set Theory of Polish Group Actions, London Mathematical Society Lecture Note Series, Cambridge University Press, to appear
Equivalences generated by families of Borel sets, Proceedings of the American Mathematical Society
69 (1978), pp. 323-326.Google Scholar
Effective enumeration of classes in a Σ1
1 equivalence relation, Indiana University Mathematics Journal
28 (1979), pp. 353-364.Google Scholar
Complexity of hereditarily decomposable continua, preprint.
and
Equivalence relations, projective and beyond, Logic Colloquium 78 (, and eds.), North-Holland, 1979, pp. 247-264.
and
Counting equivalence classes for co-k-Suslin equivalence relations, Logic Colloquium –80 (
and eds.), North-Holland, 1982, pp. 147-152.
Path-connectedness in ℝ2 is Π1
1-hard, unpublished TeX file, 1993.
The Higher Infinite, Springer-Verlag, 1994.
The theory of countable analytical sets, Transactions of the American Mathematical Society
202(1975), pp. 259-297.Google Scholar
Classical Descriptive Set Theory, Springer-Verlag, 1995.
and
Arc components in metric continua, Topology and its Applications
14(1982), pp. 167-170.Google Scholar
Topology, Volume II, Academic Press, 1968.
and
Infinite games and effective descriptive set theory, Analytic Sets ( et al., eds.), Academic Press, 1980, pp. 404-470.
Descriptive Set Theory, North-Holland, 1980.
Counting the number of equivalence classes of Borel and co-analytic equivalence relations, Annals of Mathematical Logic
18 (1980), pp. 1-28.Google Scholar