English
Related papers

Related papers: Counting siblings in universal theories

200 papers

We prove two results intended to streamline proofs about cellularity that pass through mutual algebraicity. First, we show that a countable structure $M$ is cellular if and only if $M$ is $\omega$-categorical and mutually algebraic. Second,…

Logic · Mathematics 2022-08-11 Samuel Braunfeld , Michael C. Laskowski

A sibling of a relational structure $R$ is any structure $S$ which can be embedded into $R$ and, vice versa, in which $R$ can be embedded. Let $sib(R)$ be the number of siblings of $R$, these siblings being counted up to isomorphism.…

Logic · Mathematics 2019-05-29 Claude Laflamme , Maurice Pouzet , Norbert Sauer , Robert Woodrow

We indicate a way of distinguishing between structures, for which, two structures are said to be separable.Being separable implies being non-isomorphic. We show that for any first order theory $T$ in a countable language, if it has an…

Logic · Mathematics 2012-11-28 Mohammad Assem

We prove that a countable dimensional associative algebra (resp. a countable semigroup) of locally subexponential growth is $M_\infty$-embeddable as a left ideal in a finitely generated algebra (resp. semigroup) of subexponential growth.…

Rings and Algebras · Mathematics 2017-03-28 Adel Alahmadi , Hamed Alsulami , S. K. Jain , Efim Zelmanov

Answering some of the main questions from [MR13], we show that whenever $\kappa$ is a cardinal satisfying $\kappa^{< \kappa} = \kappa > \omega$, then the embeddability relation between $\kappa$-sized structures is strongly invariantly…

Logic · Mathematics 2021-02-18 Filippo Calderoni , Heike Mildenberger , Luca Motto Ros

We introduce the notions of a mutually algebraic structures and theories and prove many equivalents. A theory $T$ is mutually algebraic if and only if it is weakly minimal and trivial if and only if no model $M$ of $T$ has an expansion…

Logic · Mathematics 2012-07-25 Michael C. Laskowski

We indicate a way of distinguishing between structures, for which, we call two structures distinguishable. Roughly, being distinguishable means that they differ in the number of realizations each gives for some formula. Being…

Logic · Mathematics 2016-11-04 Mohammad Assem

In several classes of countable structures it is known that every hyperarithmetic structure has a computable presentation up to bi-embeddability. In this article we investigate the complexity of embeddings between bi-embeddable structures…

Logic · Mathematics 2021-11-30 Nikolay Bazhenov , Dino Rossegger , Maxim Zubkov

Using the notion of existentially closed structures, we obtain embedding theorems for groups and Lie algebras. We also prove the existence of some groups and Lie algebras with prescribed properties.

Group Theory · Mathematics 2014-05-07 M. Shahryari

We prove that an arbitrary countable dimensional Lie algebra over a field of characteristic $\neq 2$ that is locally of subexponential growth is embeddable in a finitely generated Lie algebra of subexponential growth.

Rings and Algebras · Mathematics 2017-12-21 Adel Alahmadi , Hamed Alsulami

Let $A$ be an algebra over any field. We do not assume that $A$ has an identity. The \emph{multiplier algebra} $M(A)$ is a unital algebra associated to $A$. If we require the product in $A$ to be non-degenerate (as a bilinear form), the…

Rings and Algebras · Mathematics 2025-07-14 Alfons Van Daele , Joost Vercruysse

Louveau and Rosendal [5] have shown that the relation of bi-embeddability for countable graphs as well as for many other natural classes of countable structures is complete under Borel reducibility for analytic equivalence relations. This…

Logic · Mathematics 2011-12-05 Sy-David Friedman , Luca Motto Ros

We introduce the notion of a cellular system in order to deal with quasi-hereditary algebras. We shall prove that a necessary and sufficient condition for an algebra to be quasi-hereditary is the existence of a full divisible cellular…

Representation Theory · Mathematics 2007-05-23 Jie Du

Vaught's Conjecture states that if $T$ is a complete first order theory in a countable language that has more than $\aleph_0$ pairwise non-isomorphic countably infinite models, then $T$ has $2^{\aleph_0}$ such models. Morley showed that if…

Logic · Mathematics 2018-11-21 M. Assem , T. S. Ahmed , G. Sági , D. Sziráki

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ś

We show that Morley's theorem on the number of countable models of a countable first-order theory becomes an undecidable statement when extended to second-order logic. More generally, we calculate the number of equivalence classes of…

Logic · Mathematics 2023-07-06 Christopher J. Eagle , Clovis Hamel , Sandra Müller , Franklin D. Tall

A cell algebra structure is found for a family of generalized Schur algebras previously studied by the author. This cell algebra structure is then used to construct the irreducible representations of these algebras and to determine when the…

Representation Theory · Mathematics 2016-01-18 Robert D. May

We show there exists a complete theory in a language of size continuum possessing a unique atomic model which is not constructible. We also show it is consistent with $ZFC + \aleph_1 < 2^{\aleph_0}$ that there is a complete theory in a…

Logic · Mathematics 2016-07-27 Douglas Ulrich

A structure $\mathcal{M}$ in a first-order language $\mathcal{L}$ is \emph{indivisible} if for every coloring of $M$ in two colors, there is a monochromatic $\mathcal{M}^{\prime} \subseteq \mathcal{M}$ such that…

Logic · Mathematics 2019-09-04 Nadav Meir

We consider several ways of decomposing models into parts of bounded size forming a congruence over a base, and show that admitting any such decomposition is equivalent to mutual algebraicity at the level of theories. We also show that a…

Logic · Mathematics 2022-08-11 Samuel Braunfeld , Michael C Laskowski
‹ Prev 1 2 3 10 Next ›