English
Related papers

Related papers: Vaught's Conjecture for Almost Chainable Theories

200 papers

The Svenonius theorem describes the (first-order) definability in a structure in terms of permutations preserving the relations of elementary extensions of the structure. In the present paper we prove a version of this theorem using…

Logic · Mathematics 2016-05-17 A. L. Semenov , S. F. Soprunov

We study finite first-order satisfiability (FSAT) in the constructive setting of dependent type theory. Employing synthetic accounts of enumerability and decidability, we give a full classification of FSAT depending on the first-order…

Logic in Computer Science · Computer Science 2023-06-22 Dominik Kirst , Dominique Larchey-Wendling

Invertibility is important in ring theory because it enables division and facilitates solving equations. Moreover, (nonassociative) rings can be endowed with an extra ''structure'' such as order and topology allowing more richness in the…

Commutative Algebra · Mathematics 2025-10-07 Nizar El Idrissi , Hicham Zoubeir

An algebra is finitely related (or has finite degree) if its term functions are determined by some finite set of finitary relations. Nilpotent monoids built from words, via Rees quotients of free monoids, have been used to exhibit many…

Group Theory · Mathematics 2024-07-08 Daniel Glasson

A category is called {\em split} if for every morphism $s\colon X\to Y$ there exists a morphism $t\colon Y\to X$ such that $s\circ t\circ s = s$. Let $C$ be a finite split category, let $k$ be a field of characteristic 0 and let $\alpha$ be…

Representation Theory · Mathematics 2013-06-13 Robert Boltje , Susanne Danz

We prove that a connected, locally finite, quasi-transitive graph which is quasi-isometric to a planar graph is necessarily accessible. This leads to a complete classification of the finitely generated groups which are quasi-isometric to…

Group Theory · Mathematics 2026-05-14 Joseph Paul MacManus

We introduce a framework for universal algebra in categories of relational structures given by finitary relational signatures and finitary or infinitary Horn theories, with the arity $\lambda$ of a Horn theory understood as a strict upper…

Category Theory · Mathematics 2021-07-09 Chase Ford , Stefan Milius , Lutz Schröder

Let $\mathcal C$ be a class of topological semigroups. A semigroup $X$ is called $absolutely$ $\mathcal C$-$closed$ if for any homomorphism $h:X\to Y$ to a topological semigroup $Y\in\mathcal C$, the image $h[X]$ is closed in $Y$. Let…

General Topology · Mathematics 2023-01-09 Taras Banakh , Serhii Bardyla

The Suslin hypothesis states that there are no nonseparable complete dense linear orderings without endpoints which have the countable chain condition. $\mathsf{ZF + AD^+ + V = L(\mathscr{P}(\mathbb{R}))}$ proves the Suslin hypothesis. In…

Logic · Mathematics 2018-03-23 William Chan , Stephen Jackson

We study the partial orderings of the form $\langle {\mathbb P} ({\mathbb X}), \subset \rangle $, where ${\mathbb X}$ is a binary relational structure with the connectivity components isomorphic to a strongly connected structure ${\mathbb…

Logic · Mathematics 2017-09-26 Milos Kurilic

We consider recognizable trace rewriting systems with level-regular contexts (RTL). A trace language is level-regular if the set of Foata normal forms of its elements is regular. We prove that the rewriting graph of a RTL is word-automatic.…

Formal Languages and Automata Theory · Computer Science 2018-10-08 Alexandre Mansard

We determine, up to the equivalence of first-order interdefinability, all structures which are first-order definable in the random partial order. It turns out that these structures fall into precisely five equivalence classes. We achieve…

Quasiminimal structures play an important role in non-elementary categoricity. In this paper we explore possibilities of constructing quasiminimal models of a given first-order theory. We present several constructions with increasing…

Logic · Mathematics 2015-10-21 Levon Haykazyan

Let $L$ be a countable language. We characterize, in terms of definable closure, those countable theories $\Sigma$ of $\mathcal{L}_{\omega_1, \omega}(L)$ for which there exists an $S_\infty$-invariant probability measure on the collection…

Logic · Mathematics 2017-10-18 Nathanael Ackerman , Cameron Freer , Rehana Patel

An almost disjoint family $\mathcal A$ of subsets of $\mathbb N$ is said to be $\mathbb R$-embeddable if there is a function $f:\mathbb N\rightarrow \mathbb R$ such that the sets $f[A]$ are ranges of real sequences converging to distinct…

Logic · Mathematics 2019-01-04 Osvaldo Guzmán , Michael Hrušák , Piotr Koszmider

We show that every free amalgamation class of finite structures with relations and (symmetric) partial functions is a Ramsey class when enriched by a free linear ordering of vertices. This is a common strengthening of the…

Combinatorics · Mathematics 2021-07-06 David M. Evans , Jan Hubička , Jaroslav Nešetřil

Let M be a real analytic manifold, F a bounded complex of constructible sheaves. We show that the Whitney-de Rham complex associated to F is quasi-isomorphic to F.

Algebraic Geometry · Mathematics 2016-04-13 Luca Prelli

We consider Markov chains that obey the following general non-linear state space model: $\Phi_{k+1} = F(\Phi_k, \alpha(\Phi_k, U_{k+1}))$ where the function $F$ is $C^1$ while $\alpha$ is typically discontinuous and $\{U_k: k \in…

Probability · Mathematics 2019-02-07 Alexandre Chotard , Anne Auger

The class of generic structures among those consisting of the measure algebra of a probability space equipped with an automorphism is axiomatizable by positive sentences interpreted using an approximate semantics. The separable generic…

Logic · Mathematics 2007-05-23 Alexander Berenstein , C. Ward Henson

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