The field of descriptive set theory is mainly concerned with studying subsets of the space of all countable binary sequences. In this paper we study the generalization where countable is replaced by uncountable. We explore properties of generalized Baire and Cantor spaces, equivalence relations and their Borel reducibility. The study shows that the descriptive set theory looks very dierent in this generalized setting compared to the classical, countable case. We also draw the connection between the stability theoretic complexity of first-order theories and the descriptive set theoretic complexity of their isomorphism relations. Our results suggest that Borel reducibility on uncountable structures is a model theoretically natural way to comp...
We establish a dichotomy theorem characterizing the circumstances under which a treeable Borel equiv...
Working within the framework of descriptive set theory, we show that the isomorphism relation for fi...
We study the complexity of the classification problem for countable models of set theory (ZFC). We p...
The field of descriptive set theory is mainly concerned with studying subsets of the space of all co...
Descriptive set theory is mainly concerned with studying subsets of the space of all countable binar...
Descriptive set theory is mainly concerned with studying subsets of the space of all countable binar...
Descriptive set theory is mainly concerned with studying subsets of the space of all countable binar...
Model theory and set theory are two disciplines of mathematical logic which can be used to study the...
AbstractUsing the theory of Borel equivalence relations we analyze the isomorphism relation on the c...
In this work we consider several instances of the following problem: "how complicated can the isomor...
Classification is an important goal in many branches of mathematics. The idea is to describe the mem...
Classification is an important goal in many branches of mathematics. The idea is to describe the mem...
AbstractUsing the theory of Borel equivalence relations we analyze the isomorphism relation on the c...
Using the theory of Borel equivalence relations we analyze the isomorphism relation on the countable...
Using the theory of Borel equivalence relations we analyze the isomorphism relation on the countable...
We establish a dichotomy theorem characterizing the circumstances under which a treeable Borel equiv...
Working within the framework of descriptive set theory, we show that the isomorphism relation for fi...
We study the complexity of the classification problem for countable models of set theory (ZFC). We p...
The field of descriptive set theory is mainly concerned with studying subsets of the space of all co...
Descriptive set theory is mainly concerned with studying subsets of the space of all countable binar...
Descriptive set theory is mainly concerned with studying subsets of the space of all countable binar...
Descriptive set theory is mainly concerned with studying subsets of the space of all countable binar...
Model theory and set theory are two disciplines of mathematical logic which can be used to study the...
AbstractUsing the theory of Borel equivalence relations we analyze the isomorphism relation on the c...
In this work we consider several instances of the following problem: "how complicated can the isomor...
Classification is an important goal in many branches of mathematics. The idea is to describe the mem...
Classification is an important goal in many branches of mathematics. The idea is to describe the mem...
AbstractUsing the theory of Borel equivalence relations we analyze the isomorphism relation on the c...
Using the theory of Borel equivalence relations we analyze the isomorphism relation on the countable...
Using the theory of Borel equivalence relations we analyze the isomorphism relation on the countable...
We establish a dichotomy theorem characterizing the circumstances under which a treeable Borel equiv...
Working within the framework of descriptive set theory, we show that the isomorphism relation for fi...
We study the complexity of the classification problem for countable models of set theory (ZFC). We p...