A general theme of computable structure theory is to investigate when structures have copies of a given complexity $Γ$. We discuss such problem for the case of equivalence structures and preorders. We show that there is a $Π^0_1$ equivalence structure with no $Σ^0_1$ copy, and in fact that the isomorphism types realized by the $Π^0_1$ equivalence structures coincide with those realized by the $Δ^0_2$ equivalence structures. We also construct a $Σ^0_1$ preorder with no $Π^0_1$ copy.
We study the relative complexity of equivalence relations and preorders from computability theory and complexity theory. Given binary relations $R, S$, a componentwise reducibility is defined by $ R\le S \iff \ex f \, \forall x, y \, [xRy \lra f(x) Sf(y)]. $ Here $f$ is taken from a suitable class of effective functions. For us the relations will be on natural numbers, and $f$ must be computable. We show that there is a $Π_1$-complete equivalence relation, but no $Πk$-complete for $k \ge 2$. We show that $Σk$ preorders arising naturally in the above-mentioned areas are $Σk$-complete. This incl…
We define notions of generically and coarsely computable relations and structures and functions between structures. We investigate the existence and uniqueness of equivalence structures in the context of these definitions
Let $E\subseteq F$ and $E'\subseteq F'$ be Borel equivalence relations on the standard Borel spaces $X$ and $Y$, respectively. The pair $(E,F)$ is simultaneously Borel reducible to the pair $(E',F')$ if there is a Borel function $f:X\to Y$ that is both a reduction from $E$ to $E'$ and a reduction from $F$ to $F'$. Simultaneous Borel embeddings and isomorphisms are defined analogously. We classify all pairs $E\subseteq F$ of smooth countable Borel equivalence relations up to simultaneous Borel bireducibility and biembeddability, and a significant portion of such pairs up to simultaneous Borel i…
How does the first order language of fields encode birational invariants of varieties?... This question is related to rational points on varieties and effectiveness in algebraic/arithmetic geometry.
A split preorder is a preordering relation on the disjoint union of two sets, which function as source and target when one composes split preorders. The paper presents by generators and equations the category SplPre, whose arrows are the split preorders on the disjoint union of two finite ordinals. The same is done for the subcategory Gen of SplPre, whose arrows are equivalence relations, and for the category Rel, whose arrows are the binary relations between finite ordinals, and which has an isomorphic image within SplPre by a map that preserves composition, but not identity arrows. It was sh…
For a class $\mathcal K$ of countable relational structures, a countable Borel equivalence relation $E$ is said to be $\mathcal K$-structurable if there is a Borel way to put a structure in $\mathcal K$ on each $E$-equivalence class. We study in this paper the global structure of the classes of $\mathcal K$-structurable equivalence relations for various $\mathcal K$. We show that $\mathcal K$-structurability interacts well with several kinds of Borel homomorphisms and reductions commonly used in the classification of countable Borel equivalence relations. We consider the poset of classes of $\…
Motivated by recent work of Florian Pop, we study the connections between three notions of equivalence of function fields: isomorphism, elementary equivalence, and the condition that each of a pair of fields can be embedded in the other, which we call isogeny. Some of our results are purely geometric: we give an isogeny classification of Severi-Brauer varieties and of quadric surfaces. These results are applied to deduce new instances of "elementary equivalence implies isomorphism": for all genus zero curves over a number field, and for certain genus one curves over a number field, including s…
We improve the known results about the complexity of the relation of isomorphism between separable Banach spaces up to Borel reducibility, and we achieve this using the classical spaces $c_0$, $\ell_p$ and $L_p$, $1 \leq p <2$. More precisely, we show that the relation $E_{K_σ}$ is Borel reducible to isomorphism and complemented biembeddability between subspaces of $c_0$ or $\ell_p, 1 \leq p <2$. We show that the relation $E_{K_σ} \otimes =^+$ is Borel reducible to isomorphism, complemented biembeddability, and Lipschitz equivalence between subspaces of $L_p, 1 \leq p <2$.
Working with uncountable structures of fixed cardinality, we investigate the complexity of certain equivalence relations and show that if V = L, then many of them are Σ^1_1-complete, in particular the isomorphism relation of dense linear orders. Then we show that it is undecidable in ZFC whether or not the isomorphism relation of a certain well behaved theory (stable, NDOP, NOTOP) is Σ^1_1-complete (it is, if V = L, but can be forced not to be).
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Σ^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 Kechr…
It is proved that the relation of isomorphism between separable Banach spaces is a complete analytic equivalence relation, i.e., that any analytic equivalence relation Borel reduces to it. Thus, separable Banach spaces up to isomorphism provide complete invariants for a great number of mathematical structures up to their corresponding notion of isomorphism. The same is shown to hold for (1) complete separable metric spaces up to uniform homeomorphism, (2) separable Banach spaces up to Lipschitz isomorphism, and (3) up to (complemented) biembeddability, (4) Polish groups up to topological isomo…
We generalize a well-known theorem binding the elementary equivalence relation on the level of PAC fields and the isomorphism class of their absolute Galois groups. Our results concern two cases: saturated PAC structures and non-saturated PAC structures.
Given an L_{ω_1 ω}-elementary class C, that is the collection of the countable models of some L_{ω_1 ω}-sentence, denote by \cong_C and \equiv_C the analytic equivalence relations of, respectively, isomorphism and bi-embeddability on C. Generalizing some questions of Louveau and Rosendal [LR05], in [FMR09] it was proposed the problem of determining which pairs of analytic equivalence relations (E,F) can be realized (up to Borel bireducibility) as pairs of the form (\cong_C,\equiv_C), C some L_{ω_1 ω}-elementary class (together with a partial answer for some specific cases). Here we will provid…
We prove that the isomorphism problem for separable nuclear C*-algebras is complete in the class of orbit equivalence relations. In fact, already the isomorphism of simple, separable AI C*-algebras is a complete orbit equivalence relation. This means that any isomorphism problem arsing from a continuous action of a separable completely metrizable group can be reduced to the isomorphism of simple, separable AI C*-algebras. As a consequence, we get that the isomorphism problems for separable nuclear C*-algebras and for separable C*-algebras have the same complexity. This answers questions posed …
We study the first-order axiomatisability of finite semiring interpretations or, equivalently, the question whether elementary equivalence and isomorphism coincide for valuations of atomic facts over a finite universe into a commutative semiring. Contrary to the classical case of Boolean semantics, where every finite structure can obviously be axiomatised up to isomorphism by a first-order sentence, the situation in semiring semantics is rather different, and strongly depends on the underlying semiring. We prove that for a number of important semirings, including min-max semirings, and the sem…
Proof nets provide permutation-independent representations of proofs and are used to investigate coherence problems for monoidal categories. We investigate a coherence problem concerning Second Order Multiplicative Linear Logic (MLL2), that is, the one of characterizing the equivalence over proofs generated by the interpretation of quantifiers by means of ends and coends. We provide a compact representation of proof nets for a fragment of MLL2 related to the Yoneda isomorphism. By adapting the "rewiring approach" used in coherence results for star-autonomous categories, we define an equivalenc…
For a finite lattice $Λ$, $Λ$-ultrametric spaces have, among other reasons, appeared as a means of constructing structures with lattices of equivalence relations embedding $Λ$. This makes use of an isomorphism of categories between $Λ$-ultrametric spaces and structures equipped with certain families of equivalence relations. We extend this isomorphism to the case of infinite lattices. We also pose questions about representing a given finite lattice as the lattice of $\emptyset$-definable equivalence relations of structures with model-theoretic symmetry properties.
In this paper we explore a family of type isomorphisms in System F whose validity corresponds, semantically, to some form of the Yoneda isomorphism from category theory. These isomorphisms hold under theories of equivalence stronger than beta-eta-equivalence, like those induced by parametricity and dinaturality. We show that the Yoneda type isomorphisms yield a rewriting over types, that we call Yoneda reduction, which can be used to eliminate quantifiers from a polymorphic type, replacing them with a combination of monomorphic type constructors. We establish some sufficient conditions under w…
Invertible map equivalences are approximations of graph isomorphism that refine the well-known Weisfeiler-Leman method. They are parametrised by a number k and a set Q of primes. The intuition is that two graphs G and H which are equivalent with respect to k-Q-IM-equivalence cannot be distinguished by a refinement of k-tuples given by linear operators acting on vector spaces over fields of characteristic p, for any p in Q. These equivalences first appeared in the study of rank logic, but in fact they can be used to delimit the expressive power of any extension of fixed-point logic with linear-…
We show some applications of the formulas-as-polynomials correspondence: 1) a method for (dis)proving formula isomorphism and equivalence based on showing (in)equality; 2) a constructive analogue of the arithmetical hierarchy, based on the exp-log normal form. The results are valid intuitionistically, as well as classically.
