Dichotomy theorems for countably infinite dimensional analytic hypergraphs

Annals of Pure and Applied Logic 162 (7):561-565 (2011)
  Copy   BIBTEX

Abstract

We give classical proofs, strengthenings, and generalizations of Lecomte’s characterizations of analytic ω-dimensional hypergraphs with countable Borel chromatic number

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2011.01.005

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Reflections on Skolem's Paradox.Timothy Bays - 2000 - Dissertation, University of California, Los Angeles
The graph-theoretic approach to descriptive set theory.Benjamin D. Miller - 2012 - Bulletin of Symbolic Logic 18 (4):554-575.
Analytic countably splitting families.Otmar Spinas - 2004 - Journal of Symbolic Logic 69 (1):101-117.
Infinitesimals are too small for countably infinite fair lotteries.Alexander R. Pruss - 2014 - Synthese 191 (6):1051-1057.
More undecidable lattices of Steinitz exchange systems.L. R. Galminas & John W. Rosenthal - 2002 - Journal of Symbolic Logic 67 (2):859-878.
Some dichotomy theorems for isomorphism relations of countable models.Su Gao - 2001 - Journal of Symbolic Logic 66 (2):902-922.
On the elementary equivalence of automorphism groups of Boolean algebras; downward Skolem löwenheim theorems and compactness of related quantifiers.Matatyahu Rubin & Saharon Shelah - 1980 - Journal of Symbolic Logic 45 (2):265-283.
Coordinate formalism on Hilbert manifolds.Alexey Kryukov - unknown
U-Meager sets when the cofinality and the coinitiality of U are uncountable.Bosko Zivaljevic - 1991 - Journal of Symbolic Logic 56 (3):906-914.
An outcome of the de finetti infinite lottery is not finite.Marc Burock - unknown
Relational structures determined by their finite induced substructures.I. M. Hodkinson & H. D. Macpherson - 1988 - Journal of Symbolic Logic 53 (1):222-230.
A consistent theory of attributes in a logic without contraction.Richard B. White - 1993 - Studia Logica 52 (1):113 - 142.
Quantifier elimination for neocompact sets.H. Jerome Keisler - 1998 - Journal of Symbolic Logic 63 (4):1442-1472.

Analytics

Added to PP
2013-10-27

Downloads
43 (#361,277)

6 months
8 (#342,364)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

The graph-theoretic approach to descriptive set theory.Benjamin D. Miller - 2012 - Bulletin of Symbolic Logic 18 (4):554-575.

Add more citations

References found in this work

No references found.

Add more references