English
Related papers

Related papers: On countable isotypic structures

200 papers

We initiate the computability-theoretic study of ringed spaces and schemes. In particular, we show that any Turing degree may occur as the least degree of an isomorphic copy of a structure of these kinds. We also show that these structures…

Logic · Mathematics 2011-11-10 Wesley Calvert , Valentina Harizanov , Alexandra Shlapentokh

We classify the homogeneous finite-dimensional permutation structures, i.e., homogeneous structures in a language of finitely many linear orders, giving a nearly complete answer to a question of Cameron, and confirming the classification…

Logic · Mathematics 2020-02-26 Samuel Braunfeld , Pierre Simon

We consider interpretable topological spaces and topological groups in a $p$-adically closed field $K$. We identify a special class of "admissible topologies" with topological tameness properties like generic continuity, similar to the…

Logic · Mathematics 2022-08-23 Will Johnson

The degree spectrum of a countable structure is the set of all Turing degrees of presentations of that structure. We show that every nonlow Turing degree lies in the spectrum of some differentially closed field (of characteristic 0, with a…

Logic · Mathematics 2018-02-12 David Marker , Russell Miller

We present a new structure theorem for finite fields of odd order that relates multiplicative and additive structure in an interesting way. This theorem has several applications, including an improved understanding of Dickson and Chebyshev…

Number Theory · Mathematics 2021-05-04 Antonia W. Bluher

Tree sets are posets with additional structure that generalize tree-like objects in graphs, matroids, or other combinatorial structures. They are a special class of abstract separation systems. We study infinite tree sets and how they…

Combinatorics · Mathematics 2025-05-16 Jay Lilian Kneip

We study the possible structures which can be carried by sets which have no countable subset, but which fail to be `surjectively Dedekind finite', in two possible senses, that there is a surjection to $\omega$, or alternatively, that there…

Logic · Mathematics 2025-09-17 Supakun Panasawatwong , J K Truss

We describe and classify countable Boolean rings (which may or may not have a multiplicative identity) with finitely many distinguished ideals whose elementary theory is countably categorical. This extends the description by Macintyre and…

Logic · Mathematics 2025-08-13 Andrew Apps

We study the existence of uncountable first-order structures that are homogeneous with respect to their finitely generated substructures. In many classical cases this is either well-known or follows from general facts, for example, if the…

Logic · Mathematics 2025-10-21 Adam Bartoš , Wiesław Kubiś

Using new techniques for controlling the categoricity spectrum of a structure, we construct a structure with degree of categoricity but infinite spectral dimension, answering a question of Bazhenov, Kalimulin and Yamaleev. Using the same…

Logic · Mathematics 2020-01-29 Dan Turetsky

We study cofinal systems of finite subsets of $\omega_1$. We show that while such systems can be NIP, they cannot be defined in an NIP structure. We deduce a positive answer to a question of Chernikov and Simon from 2013: in an NIP theory,…

Logic · Mathematics 2024-11-20 Martin Bays , Omer Ben-Neria , Itay Kaplan , Pierre Simon

We construct a fully faithful functor from the category of graphs to the category of fields. Using this functor, we resolve a longstanding open problem in computable model theory, by showing that for every nontrivial countable structure S,…

Logic · Mathematics 2015-10-27 Russell Miller , Bjorn Poonen , Hans Schoutens , Alexandra Shlapentokh

We examine various categorical structures that can and cannot be constructed. We show that total computable functions can be mimicked by constructible functors. More generally, whatever can be done by a Turing machine can be constructed by…

Computational Complexity · Computer Science 2018-10-01 Noson S. Yanofsky

We introduce and study a natural class of fields in which certain first-order definable sets are existentially definable, and characterise this class by a number of equivalent conditions. We show that global fields belong to this class, and…

Logic · Mathematics 2023-06-22 Philip Dittmann , Dion Leijnse

We continue investigating the structure of externally definable sets in NIP theories and preservation of NIP after expanding by new predicates. Most importantly: types over finite sets are uniformly definable; over a model, a family of…

Logic · Mathematics 2012-02-14 Artem Chernikov , Pierre Simon

We consider the classification problem for several classes of countable structures which are "vertex-transitive", meaning that the automorphism group acts transitively on the elements. (This is sometimes called homogeneous.) We show that…

Logic · Mathematics 2019-08-16 John Clemens , Samuel Coskey , Stephanie Potter

We prove that topological isomorphism on procountable groups is not classifiable by countable structures, in the sense of descriptive set theory. In fact, the equivalence relation $\ell_\infty$ expressing that two sequences of reals have a…

Logic · Mathematics 2026-03-30 Su Gao , André Nies , Gianluca Paolini

On the transversals of a subgroup of a group, using the binary operation of the group, structural mappings are defined. Based on these mappings, the notion of the hypergroup over the group is introduced, which generalizes the notion of the…

Group Theory · Mathematics 2015-08-11 Samuel H. Dalalyan

We consider residue structures $R/G$ where $(G,+)$ is an additive subgroup of a ring $(R,+,\cdot)$, not necessarily an ideal. Special instances include Krasner's construction of quotient hyperfields, and Pumpluen's construction of…

Rings and Algebras · Mathematics 2024-03-19 Louis H. Rowen

In this paper we define countable-configuration of groups and prove that two Hopfian groups with the same set of countable-configurations are isomorphic and vice versa. We also study the countable paradoxical decomposition of groups. It is…

Functional Analysis · Mathematics 2021-10-22 M. Meisami , A. Rejali , A. Yousofzadeh