English
Related papers

Related papers: The Countable Admissible Ordinal Equivalence Relat…

200 papers

The space of Lascar strong types, on some sort and relative to a given first order theory T, is in general not a compact Hausdorff space. This paper has at least three aims. First to show that spaces of Lascar strong types and other related…

Logic · Mathematics 2012-04-17 Krzysztof Krupinski , Anand Pillay , Slawomir Solecki

Recently, a surprising connection between algorithmic learning of algebraic structures and descriptive set theory has emerged. Following this line of research, we define the learning power of an equivalence relation $E$ on a topological…

Logic · Mathematics 2025-01-23 Vittorio Cipriani , Alberto Marcone , Luca San Mauro

We extend the classical Feferman-Vaught theorem to logic for metric structures. This implies that the reduced powers of elementarily equivalent structures are elementarily equivalent, and therefore they are isomorphic under the Continuum…

Logic · Mathematics 2016-04-06 Saeed Ghasemi

Let $(\Omega,\mathcal{F})$ be a standard Borel space and $\mathcal{P}(\mathcal{F})$ the collection of all probability measures on $\mathcal{F}$. Let $E\subset\Omega\times\Omega$ be a measurable equivalence relation, that is,…

Probability · Mathematics 2023-12-06 Luca Pratelli , Pietro Rigo

We determine the exact complexity of classifying compact metric spaces up to homeomorphism. More precisely, the homeomorphism relation on compact metric spaces is Borel bi-reducible with the complete orbit equivalence relation of Polish…

Logic · Mathematics 2014-09-22 Joseph Zielinski

A relational structure is a core, if all its endomorphisms are embeddings. This notion is important for computational complexity classification of constraint satisfaction problems. It is a fundamental fact that every finite structure has a…

Logic in Computer Science · Computer Science 2017-01-11 Manuel Bodirsky

Assuming the Continuum Hypothesis, there is a compact first countable connected space of weight aleph_1 with no totally disconnected perfect subsets. Each such space, however, may be destroyed by some proper forcing order which does not add…

General Topology · Mathematics 2007-05-23 Joan E. Hart , Kenneth Kunen

Cantor's ordinal numbers, a powerful extension of the natural numbers, are a cornerstone of set theory. They can be used to reason about the termination of processes, prove the consistency of logical systems, and justify some of the core…

Logic in Computer Science · Computer Science 2025-10-22 Tom de Jong , Nicolai Kraus , Fredrik Nordvall Forsberg , Chuangjie Xu

Every permutation invariant Borel subset of the space of countable structures is definable in $\La_{\omega_1\omega}$ by a theorem of Lopez-Escobar. We prove variants of this theorem relative to fixed relations and fixed non-permutation…

Logic · Mathematics 2010-03-15 Fredrik Engström , Philipp Schlicht

In [9] we proved that the space of countable torsion-free abelian groups is Borel complete. In this paper we show that our construction from [9] satisfies several additional properties of interest. We deduce from this that countable…

Logic · Mathematics 2026-01-27 Gianluca Paolini , Saharon Shelah

A relational structure is called reversible iff every bijective endomorphism of that structure is an automorphism. We give several equivalents of that property in the class of disconnected binary structures and some its subclasses. For…

Logic · Mathematics 2017-11-07 Miloš S. Kurilić , Nenad Morača

A finite relational structure A is called compact if for any infinite relational structure B of the same type, the existence of a homomorphism from B to A is equivalent to the existence of homomorphisms from all finite substructures of B to…

Logic · Mathematics 2026-03-09 Claude Tardif

A relational structure ${\mathbb X}$ is said to be reversible iff every bijective endomorphism $f:X\rightarrow X$ is an automorphism. We define a sequence of non-zero cardinals $\langle \kappa_i :i\in I\rangle$ to be reversible iff each…

Logic · Mathematics 2017-09-28 Miloš S. Kurilić , Nenad Morača

We study notions of generic and coarse computability in the context of computable structure theory. Our notions are stratified by the $\Sigma_\beta$ hierarchy. We focus on linear orderings. We show that at the $\Sigma_1$ level all linear…

Logic · Mathematics 2024-01-29 Wesley Calvert , Douglas Cenzer , David Gonzalez , Valentina Harizanov

In this paper we address the question: How many pairwise non-isomorphic extremely amenable groups are there which are separable metrizable or even Polish? We show that there are continuum many such groups. In fact we construct continuum…

Logic · Mathematics 2026-03-23 Mahmood Etedadialiabadi , Su Gao , Feng Li , Ruiwen Li

In the aftermath of the Robertson--Seymour Graph Minor Theorem, Thomas conjectured that the countable graphs are well-quasi-ordered under the minor relation. We prove that this conjecture, when restricted to graphs with no infinite paths…

Combinatorics · Mathematics 2025-10-23 Agelos Georgakopoulos

We show that the existence of a first-order formula separating two monadic second order formulas over countable ordinal words is decidable. This extends the work of Henckell and Almeida on finite words, and of Place and Zeitoun on…

Logic in Computer Science · Computer Science 2022-01-11 Thomas Colcombet , Sam van Gool , Rémi Morvan

We prove that for a countable, commutative ring $R$, the class of countable $R$-modules either has only countably many isomorphism types, or else it is Borel complete. The machinery gives a succinct proof of the Borel completeness of TFAB,…

Logic · Mathematics 2022-09-16 Michael C. Laskowski , Danielle S. Ulrich

In this article, we give a full description of the Wadge degrees of Borel functions from $\omega^\omega$ to a better quasi ordering $\mathcal{Q}$. More precisely, for any countable ordinal $\xi$, we show that the Wadge degrees of…

Logic · Mathematics 2017-05-23 Takayuki Kihara , Antonio Montalbán

A variation of the Scott analysis of countable structures is applied to actions of non-Archimedean TSI Polish groups acting continuously on a Polish spaces. We give results on the potential Borel complexity spectrum of such groups, and…

Logic · Mathematics 2023-04-05 Shaun Allison
‹ Prev 1 8 9 10 Next ›