Working within Bishop’s constructive framework, we examine the connection between a weak version of the Heine–Borel property, a property antithetical to that in Specker’s theorem in recursive analysis, and the uniform continuity theorem for integer-valued functions. The paper is a contribution to the ongoing programme of constructive reverse mathematics.

This article presents a weak system of intuitionistic second-order arithmetic, WKV, a subsystem of the one in S.C. Kleene, R.E. Vesley [The Foundations of Intuitionistic Mathematics: Especially in Relation to Recursive Functions, North-Holland Publishing Company, Amsterdam, 1965]. It is then shown that some statements of real analysis, like a version of the Heine–Borel Theorem, and some statements of logic, e.g. compactness of classical proposition calculus, are equivalent to the Fan Theorem in this system.

This paper is about the metaphysical debate whether objects persist over time by the selfsame object existing at different times (nowadays called “endurance” by metaphysicians), or by different temporal parts, or stages, existing at different times (called “perdurance”). I aim to illuminate the debate by using some elementary kinematics and real analysis: resources which metaphysicians have, surprisingly, not availed themselves of. There are two main results, which are of interest to both endurantists and perdurantists. (1) I describe a precise formal (...) equivalence between the way that the two metaphysical positions represent the motion of the objects of classical mechanics (both point-particles and continua). (2) I make precise, and prove a result about, the idea that the persistence of objects moving in a void is to be analysed in terms of tracking the continuous curves in spacetime that connect points occupied by matter. The result is entirely elementary: it is a corollary of the Heine–Borel theorem. (shrink)

In this paper we are concerned with definably, with or without parameters, complete expansions of ordered fields, i. e. those with no definable gaps. We present several axiomatizations, like being definably connected, in each of the two cases. As a corollary, when parameters are allowed, expansions of ordered fields are o-minimal if and only if all their definable subsets are finite disjoint unions of definably connected subsets. We pay attention to how simply a definable gap in an expansion is so. (...) Next we prove that over parametrically definably complete expansions of ordered fields, all one-to-one definable continuous functions are monotone and open. Moreover, in both parameter and parameter-free cases again, definably complete expansions of ordered fields satisfy definable versions of the Heine-Borel and Extreme Value theorems and also Bounded Intersection Property for definable families of closed bounded subsets. (shrink)

We develop a constructive version of nonstandard analysis, extending Bishop's constructive analysis with infinitesimal methods. A full transfer principle and a strong idealisation principle are obtained by using a sheaf-theoretic construction due to I. Moerdijk. The construction is, in a precise sense, a reduced power with variable filter structure. We avoid the nonconstructive standard part map by the use of nonstandard hulls. This leads to an infinitesimal analysis which includes nonconstructive theorems such as the Heine-Borel theorem, the (...) Cauchy-Peano existence theorem for ordinary differential equations and the exact intermediate-value theorem, while it at the same time provides constructive results for concrete statements. A nonstandard measure theory which is considerably simpler than that of Bishop and Cheng is developed within this context. (shrink)

In this note we show that proof-theoretic uniform boundedness or bounded collection principles which allow one to formalize certain instances of countable Heine–Borel compactness in proofs using abstract metric structures must be carefully distinguished from an unrestricted use of countable Heine–Borel compactness.

In intuitionistic analysis, "Brouwer's Continuity Principle" implies, together with an "Axiom of Countable Choice", that the positively Borel sets form a genuinely growing hierarchy: every level of the hierarchy contains sets that do not occur at any lower level.

How are the various classically equivalent definitions of compactness for metric spaces constructively interrelated? This question is addressed with Bishop-style constructive mathematics as the basic system – that is, the underlying logic is the intuitionistic one enriched with the principle of dependent choices. Besides surveying today's knowledge, the consequences and equivalents of several sequential notions of compactness are investigated. For instance, we establish the perhaps unexpected constructive implication that every sequentially compact separable metric space is totally bounded. As a by-product, (...) the fan theorem for detachable bars of the complete binary fan proves to be necessary for the unit interval possessing the Heine-Borel property for coverings by countably many possibly empty open balls. (shrink)

The classical Hahn–Banach Theorem states that any linear bounded functional defined on a linear subspace of a normed space admits a norm-preserving linear bounded extension to the whole space. The constructive and computational content of this theorem has been studied by Bishop, Bridges, Metakides, Nerode, Shore, Kalantari Downey, Ishihara and others and it is known that the theorem does not admit a general computable version. We prove a new computable version of this theorem without unrolling the (...) classical proof of the theorem itself. More precisely, we study computability properties of the uniform extension operator which maps each functional and subspace to the set of corresponding extensions. It turns out that this operator is upper semi-computable in a well-defined sense. By applying a computable version of the Banach–Alaoglu Theorem we can show that computing a Hahn–Banach extension cannot be harder than finding a zero in a compact metric space. This allows us to conclude that the Hahn–Banach extension operator is ${\bf {\Sigma^{0}_{2}}}$ -computable while it is easy to see that it is not lower semi-computable in general. Moreover, we can derive computable versions of the Hahn–Banach Theorem for those functionals and subspaces which admit unique extensions. (shrink)

We show that there is an antichain basis for neither the class of non-potentially closed Borel subsets of the plane under Borel rectangular reducibility nor the class of analytic graphs of uncountable Borel chromatic number under Borel reducibility.

Yu, X., Riesz representation theorem, Borel measures and subsystems of second-order arithmetic, Annals of Pure and Applied Logic 59 65-78. Formalized concept of finite Borel measures is developed in the language of second-order arithmetic. Formalization of the Riesz representation theorem is proved to be equivalent to arithmetical comprehension. Codes of Borel sets of complete separable metric spaces are defined and proved to be meaningful in the subsystem ATR0. Arithmetical transfinite recursion is enough to prove the (...) measurability of Borel sets for any finite Borel measure on a compact complete separable metric space. (shrink)

We study the κ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\kappa $$\end{document}-Borel-reducibility of isomorphism relations of complete first order theories in a countable language and show the consistency of the following: For all such theories T and T′\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$T^{\prime }$$\end{document}, if T is classifiable and T′\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$T^{\prime }$$\end{document} is not, then the isomorphism of models of T′\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} (...) \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$T^{\prime }$$\end{document} is strictly above the isomorphism of models of T with respect to κ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\kappa $$\end{document}-Borel-reducibility. In fact, we can also ensure that a range of equivalence relations modulo various non-stationary ideals are strictly between those isomorphism relations. The isomorphism relations are considered on models of some fixed uncountable cardinality obeying certain restrictions. (shrink)

Louveau showed that if a Borel set in a Polish space happens to be in a Borel Wadge class $$\Gamma $$, then its $$\Gamma $$ -code can be obtained from its Borel code in a hyperarithmetical manner. We extend Louveau’s theorem to Borel functions: If a Borel function on a Polish space happens to be a $$ \underset{\widetilde{}}{\varvec{\Sigma }}\hbox {}_t$$ -function, then one can find its $$ \underset{\widetilde{}}{\varvec{\Sigma }}\hbox {}_t$$ -code hyperarithmetically relative to its (...) Borel code. More generally, we prove extension-type, domination-type, and decomposition-type variants of Louveau’s theorem for Borel functions. (shrink)

We characterize the completely determined Borel subsets of HYP as exactly the [Formula: see text] subsets of HYP. As a result, HYP believes there is a Borel well-ordering of the reals, that the Borel Dual Ramsey Theorem fails, and that every Borel d-regular bipartite graph has a Borel perfect matching, among other examples. Therefore, the Borel Dual Ramsey Theorem and several theorems of descriptive combinatorics are not theories of hyperarithmetic analysis. In the (...) case of the Borel Dual Ramsey Theorem, this answers a question of Astor, Dzhafarov, Montalbán, Solomon and the third author. (shrink)

The investigation of computational properties of discontinuous functions is an important concern in computable analysis. One method to deal with this subject is to consider effective variants of Borel measurable functions. We introduce such a notion of Borel computability for single-valued as well as for multi-valued functions by a direct effectivization of the classical definition. On Baire space the finite levels of the resulting hierarchy of functions can be characterized using a notion of reducibility for functions and corresponding (...) complete functions. We use this classification and an effective version of a Selection Theorem of Bhattacharya-Srivastava in order to prove a generalization of the Representation Theorem of Kreitz-Weihrauch for Borel measurable functions on computable metric spaces: such functions are Borel measurable on a certain finite level, if and only if they admit a realizer on Baire space of the same quality. This Representation Theorem enables us to introduce a realizer reducibility for functions on metric spaces and we can extend the completeness result to this reducibility. Besides being very useful by itself, this reducibility leads to a new and effective proof of the Banach-Hausdorff-Lebesgue Theorem which connects Borel measurable functions with the Baire functions. Hence, for certain metric spaces the class of Borel computable functions on a certain level is exactly the class of functions which can be expressed as a limit of a pointwise convergent and computable sequence of functions of the next lower level. (shrink)

A number of results have been obtained concerning Borel structures starting with Silver and Friedman followed by Harrington, Shelah, Marker, and Louveau. Friedman also initiated the model theory of Borel (in fact totally Borel) structures. By this we mean the study of the class of Borel models of a given first-order theory. The subject was further investigated by Steinhorn. The present work is meant to go further in this direction. It is based on the assumption that (...) the study of the class of, say, countable models of a theory reduces to analyzing a single $\omega_1$-saturated model. The question then arises as to when such a model can be totally Borel. We present here a partial answer to this problem when the theory under investigation is superstable. (shrink)

We consider Borel equivalence relations E induced by actions of the infinite symmetric group, or equivalently the isomorphism relation on classes of countable models of bounded Scott rank. We relate the descriptive complexity of the equivalence relation to the nature of its complete invariants. A typical theorem is that E is potentially Π03 iff the invariants are countable sets of reals, it is potentially Π04 iff the invariants are countable sets of countable sets of reals, and so on. (...) The proofs use various techniques, including Vaught transforms, changing topologies, and the Scott analysis of countable models. (shrink)

Louveau, A., S. Shelah and B. Velikovi, Borel partitions of infinite subtrees of a perfect tree, Annals of Pure and Applied Logic 63 271–281. We define a notion of type of a perfect tree and show that, for any given type τ, if the set of all subtrees of a given perfect tree T which have type τ is partitioned into two Borel classes then there is a perfect subtree S of T such that all subtrees of S (...) of type τ belong to the same class. This result simultaneously generalizes the partition theorems of Galvin-Prikry and Galvin-Blass. The key ingredient of the proof is the theorem of Halpern-Laüchli on partitions of products of perfect trees. (shrink)

Let AC and AI denote the collections of graphs with vertex set ω and which have, respectively, no infinite independent subgraph, and no infinite complete subgraph. Both AC and AI are coanalytic sets of reals that are not analytic, and they are disjoint by Ramsey’s theorem. We prove that there exists a Borel set separating AC and AI, and we discuss the sense in which this is an infinite analogue of a weak version of.

We show that the enveloping space \ of a partial action of a Polish group G on a Polish space \ is a standard Borel space, that is to say, there is a topology \ on \ such that \\) is Polish and the quotient Borel structure on \ is equal to \\). To prove this result we show a generalization of a theorem of Burgess about Borel selectors for the orbit equivalence relation induced by a (...) group action and also show that some properties of the Vaught’s transform are valid for partial actions of groups. (shrink)

We announce two new dichotomy theorems for Borel equivalence relations, and present the results in context by giving an overview of related recent developments.§1. Introduction. For X a Polish space and E a Borel equivalence relation on X, a classification of X up to E-equivalence consists of finding a set of invariants I and a map c : X → I such that xEy ⇔ c = c. To be of any value we would expect I and c (...) to be “explicit” or “definable”. The theory of Borel equivalence relations investigates the nature of possible invariants and provides a hierarchy of notions of classification.The following partial ordering is fundamental in organizing this study. Given equivalence relations E and F on X and Y, resp., we say that E can be Borel reduced to F, in symbolsif there is a Borel map f : X → Y with xEy ⇔ fFf. Then if is an embedding of X/E into Y/F, which is “Borel”.Intuitively, E ≤BF might be interpreted in any one of the following ways: The classi.cation problem for E is simpler than that of F: any invariants for F work as well for E. One can classify E by using as invariants F-equivalence classes. The quotient space X/E has “Borel cardinality” less than or equal to that of Y/F, in the sense that there is a “Borel” embedding of X/E into Y/F. (shrink)

We study the provability in subsystems of second-order arithmetic of two theorems of Harrington and Shelah [6] about Borel quasi-orderings of the reals. These theorems turn out to be provable in ATR0, thus giving further evidence to the observation that ATR0 is the minimal subsystem of second-order arithmetic in which significant portion of descriptive set theory can be developed. As in [6] considering the lightface versions of the theorems will be instrumental in their proof and the main techniques employed (...) will be the reflection principles and Gandy forcing. (shrink)

We study the complexity of isomorphism of classes of metric structures using methods from infinitary continuous logic. For Borel classes of locally compact structures, we prove that if the equivalence relation of isomorphism is potentially $\mathbf {\Sigma }^0_2$, then it is essentially countable. We also provide an equivalent model-theoretic condition that is easy to check in practice. This theorem is a common generalization of a result of Hjorth about pseudo-connected metric spaces and a result of Hjorth–Kechris about discrete (...) structures. As a different application, we also give a new proof of Kechris’s theorem that orbit equivalence relations of actions of Polish locally compact groups are essentially countable. (shrink)

We formulate a Borel version of a corollary of Furman's superrigidity theorem for orbit equivalence and present a number of applications to the theory of countable Borel equivalence relations. In particular, we prove that the orbit equivalence relations arising from the natural actions of on the projective planes over the various p-adic fields are pairwise incomparable with respect to Borel reducibility.

The study of Borel equivalence relations under Borel reducibility has developed into an important area of descriptive set theory. The dichotomies of Silver [20] and Harrington, Kechris and Louveau [6] show that with respect to Borel reducibility, any Borel equivalence relation strictly above equality on ω is above equality on , the power set of ω, and any Borel equivalence relation strictly above equality on the reals is above equality modulo finite on . In this (...) article we examine the effective content of these and related results by studying effectively Borel equivalence relations under effectively Borel reducibility. The resulting structure is complex, even for equivalence relations with finitely many equivalence classes. However use of Kleene’s O as a parameter is sufficient to restore the picture from the noneffective setting. A key lemma is that of the existence of two effectively Borel sets of reals, neither of which contains the range of the other under any effectively Borel function; the proof of this result applies Barwise compactness to a deep theorem of Harrington establishing for any recursive ordinal α the existence of singletons whose α-jumps are Turing incomparable. (shrink)

We study the Katětov order on Borel ideals. We prove two structural theorems, one for Borel ideals, the other for analytic P-ideals. We isolate nine important Borel ideals and study the Katětov order among them. We also present a list of fundamental open problems concerning the Katětov order on Borel ideals.

In [9] we have considered a wide class of "well-behaved" reducibilities for sets of reals. In this paper we continue with the study of Borel reducibilities by proving a dichotomy theorem for the degree-structures induced by good Borel reducibilities. This extends and improves the results of [9] allowing to deal with a larger class of notions of reduction (including, among others, the Baire class ξ functions).

We present some applications of Popa’s Superrigidity Theorem to the theory of countable Borel equivalence relations. In particular, we show that the universal countable Borel equivalence relation E∞ is not essentially free.

We announce two new dichotomy theorems for Borel equivalence relations, and present the results in context by giving an overview of related recent developments.§1. Introduction. For X a Polish space and E a Borel equivalence relation on X, a classification of X up to E-equivalence consists of finding a set of invariants I and a map c : X → I such that xEy ⇔ c = c. To be of any value we would expect I and c (...) to be “explicit” or “definable”. The theory of Borel equivalence relations investigates the nature of possible invariants and provides a hierarchy of notions of classification.The following partial ordering is fundamental in organizing this study. Given equivalence relations E and F on X and Y, resp., we say that E can be Borel reduced to F, in symbolsif there is a Borel map f : X → Y with xEy ⇔ fFf. Then if is an embedding of X/E into Y/F, which is “Borel”.Intuitively, E ≤BF might be interpreted in any one of the following ways: The classi.cation problem for E is simpler than that of F: any invariants for F work as well for E. One can classify E by using as invariants F-equivalence classes. The quotient space X/E has “Borel cardinality” less than or equal to that of Y/F, in the sense that there is a “Borel” embedding of X/E into Y/F. (shrink)

Given a family${\cal C}$of infinite subsets of${\Bbb N}$, we study when there is a Borel function$S:2^{\Bbb N} \to 2^{\Bbb N} $such that for every infinite$x \in 2^{\Bbb N} $,$S\left \in {\Cal C}$and$S\left \subseteq x$. We show that the family of homogeneous sets as given by the Nash-Williams’ theorem admits such a Borel selector. However, we also show that the analogous result for Galvin’s lemma is not true by proving that there is an$F_\sigma $tall ideal on${\Bbb N}$without a (...) Borel selector. The proof is not constructive since it is based on complexity considerations. We construct a${\bf{\Pi }}_2^1 $tall ideal on${\Bbb N}$without a tall closed subset. (shrink)

We present several selection theorems for Borel relations, involving only Borel sets and functions, all of which can be obtained as consequences of closely related theorems proved in [DSR 96,99,01,01X] involving coanalytic sets. The relevant proofs given there use substantial set theoretic methods, which were also shown to be necessary. We show that none of our Borel consequences can be proved without substantial set theoretic methods. The results are established for Baire space. We give equivalents of some (...) of the main results for the reals. (shrink)

LetXbe a standard Borel space, and letEbe acountableBorel equivalence relation onX, i.e., a Borel equivalence relationEfor which every equivalence class [x]Eis countable. By a result of Feldman-Moore [FM],Eis induced by the orbits of a Borel action of a countable groupGonX.The structure of general countable Borel equivalence relations is very little understood. However, a lot is known for the particularly important subclass consisting of hyperfinite relations. A countable Borel equivalence relation is calledhyperfiniteif it is induced by (...) a Borel ℤ-action, i.e., by the orbits of a single Borel automorphism. Such relations are studied and classified in [DJK]. It is shown in Ornstein-Weiss [OW] and Connes-Feldman-Weiss [CFW] that for every Borel equivalence relationEinduced by a Borel action of a countable amenable groupGonXand for every probability measure μ onX, there is a Borel invariant setY⊆Xwith μ = 1 such thatE↾Y is hyperfinite. Motivated by this result, Weiss [W2] raised the question of whether everyEinduced by a Borel action of a countable amenable group is hyperfinite. Later on Weiss showed that this is true forG= ℤn. However, the problem is still open even for abelianG. Our main purpose here is to provide a weaker affirmative answer for general amenableG. We need a definition first. Given two standard Borel spacesX, Y, auniversally measurableisomorphism betweenXandYis a bijection ƒ:X→Ysuch that both ƒ, ƒ-1are universally measurable. Notice now that to assert that a countable Borel equivalence relation onXis hyperfinite is trivially equivalent to saying that there is a standard Borel spaceYand a hyperfinite Borel equivalence relationFonY, which isBorelisomorphic toE, i.e., there is a Borel bijection ƒ:X→YwithxEy⇔ ƒFƒ. We have the following theorem. (shrink)

In nonstandard measure theory the standard part map is very useful to represent standard measures by Loeb measures. We give here a different method of representing measures using the concept of a σ -homomorphism. As an application a measure extension theorem is derived. Finally a nonstandard proof of a result of Pták is given showing that his assumption of nonmeasurable cardinality is redundant.

In this paper we prove three theorems about the theory of Borel sets in models of ZF without any form of the axiom of choice. We prove that if \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${B\subseteq 2^\omega}$$\end{document} is a Gδσ-set then either B is countable or B contains a perfect subset. Second, we prove that if 2ω is the countable union of countable sets, then there exists an Fσδ set \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} (...) \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${C\subseteq 2^\omega}$$\end{document} such that C is uncountable but contains no perfect subset. Finally, we construct a model of ZF in which we have an infinite Dedekind finite \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${D\subseteq 2^\omega}$$\end{document} which is Fσδ. (shrink)

The author proved in his Ph.D. Thesis [W. Veldman, Investigations in intuitionistic hierarchy theory, Ph.D. Thesis, Katholieke Universiteit Nijmegen, 1981] that, in intuitionistic analysis, the positively Borel subsets of Baire space form a genuinely growing hierarchy: every level of the hierarchy contains sets that do not occur at any lower level. It follows from this result that there are natural examples of analytic and also of co-analytic sets that are not positively Borel. It turns out, however, that, in (...) intuitionistic analysis, one may give surprisingly different and, in some sense, much more simple examples of analytic and co-analytic sets that fail to be positively Borel. In the paper, two such examples are given. In proving them correct, one obtains new proofs of the Borel Hierarchy Theorem. Brouwer’s Continuity Principle plays a crucial role in arguments. (shrink)

We prove an effective version of the Lopez-Escobar theorem for continuous domains. Let $Mod(\tau )$ be the set of countable structures with universe $\omega $ in vocabulary $\tau $ topologized by the Scott topology. We show that an invariant set $X\subseteq Mod(\tau )$ is $\Pi ^0_\alpha $ in the Borel hierarchy of this topology if and only if it is definable by a $\Pi ^p_\alpha $ -formula, a positive $\Pi ^0_\alpha $ formula in the infinitary logic $L_{\omega _1\omega (...) }$. As a corollary of this result we obtain a new pullback theorem for positive computable embeddings: Let $\mathcal {K}$ be positively computably embeddable in $\mathcal {K}'$ by $\Phi $, then for every $\Pi ^p_\alpha $ formula $\xi $ in the vocabulary of $\mathcal {K}'$ there is a $\Pi ^p_\alpha $ formula $\xi ^{*}$ in the vocabulary of $\mathcal {K}$ such that for all $\mathcal {A}\in \mathcal {K}$, $\mathcal {A}\models \xi ^{*}$ if and only if $\Phi (\mathcal {A})\models \xi $. We use this to obtain new results on the possibility of positive computable embeddings into the class of linear orderings. (shrink)

We give a partial answer to an important open problem in descriptive set theory, the Decomposability Conjecture for Borel functions on an analytic subset of a Polish space to a separable metrizable space. Our techniques employ deep results from effective descriptive set theory and recursion theory. In fact it is essential to extend several prominent results in recursion theory (e.g. the Shore-Slaman Join Theorem) to the setting of Polish spaces. As a by-product we give both positive and negative (...) results on the Martin Conjecture on the degree preserving Borel functions between Polish spaces. Additionally we prove results about the transfinite version as well as the computable version of the Decomposability Conjecture. (shrink)

It is known that every Borel hypersmooth but non-smooth equivalence relation is Borel bi-reducible to E1. We prove a ROD version of this result in the Solovay model.

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

Answering one of the main questions of [S.-D. Friedman, T. Hyttinen and V. Kulikov, Generalized descriptive set theory and classification theory, Mem. Amer. Math. Soc. 230 80, Chap. 7], we show that there is a tight connection between the depth of a classifiable shallow theory [Formula: see text] and the Borel rank of the isomorphism relation [Formula: see text] on its models of size [Formula: see text], for [Formula: see text] any cardinal satisfying [Formula: see text]. This is achieved (...) by establishing a link between said rank and the [Formula: see text]-Scott height of the [Formula: see text]-sized models of [Formula: see text], and yields to the following descriptive set-theoretical analog of Shelah’s Main Gap Theorem: Given a countable complete first-order theory [Formula: see text], either [Formula: see text] is Borel with a countable Borel rank, or it is not Borel at all. The dividing line between the two situations is the same as in Shelah’s theorem, namely that of classifiable shallow theories. We also provide a Borel reducibility version of the above theorem, discuss some limitations to the possible complexities of [Formula: see text], and provide a characterization of categoricity of [Formula: see text] in terms of the descriptive set-theoretical complexity of [Formula: see text]. (shrink)