English
Related papers

Related papers: A first-order theory of Ulm type

200 papers

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

We consider strong expansions of the theory of ordered abelian groups. We show that the assumption of strength has a multitude of desirable consequences for the structure of definable sets in such theories, in particular as relates to…

Logic · Mathematics 2016-05-12 Alfred Dolich , John Goodrick

We classify essential algebras whose irredundant non-refinable covers consist of primal algebras. The proof is obtained by constructing one to one correspondence between such algebras and partial orders on finite sets. Further, we prove…

Logic · Mathematics 2014-06-26 Shohei Izawa

This paper provides an extensive study of the homotopy theory of types of algebras with units, like unital associative algebras or unital commutative algebras for instance. To this purpose, we endow the Koszul dual category of curved…

Algebraic Topology · Mathematics 2019-05-29 Brice Le Grignou

We study the modular representation theory of the symmetric and alternating groups. One of the most natural ways to label the irreducible representations of a given group or algebra in the modular case is to show the unitriangularity of the…

Representation Theory · Mathematics 2020-12-09 Olivier Brunat , Jean-Baptiste Gramain , Nicolas Jacon

We introduce a notion of compatible quasi-ordered groups which unifies valued and ordered abelian groups. It was proved in a paper by Fakhruddin that a compatible quasi-order on a field is always either an order or a valuation. We show here…

Logic · Mathematics 2018-10-26 Gabriel Lehéricy

We give a classification and complete algebraic description of groups allowing only finitely many (left multiplication invariant) circular orders. In particular, they are all solvable groups with a specific semi-direct product…

Group Theory · Mathematics 2017-04-21 Adam Clay , Kathryn Mann , Cristóbal Rivas

Our "long term and large scale" aim is to characterize the first order theories T (at least the countable ones) such that: for every ordinal alpha there lambda,M_1,M_2 such that M_1,M_2 are non-isomorphic models of T of cardinality lambda…

Logic · Mathematics 2017-08-08 Saharon Shelah

The strong isomorphism classes of extensions of finite groups are parametrized by orbits of a prescribed action on the second cohomology group. We study these orbits in the case of extensions of a finite abelian $p$-group by a cyclic factor…

Group Theory · Mathematics 2023-09-25 Oihana Garaialde Ocaña , Mima Stanojkovski

Anyon models are algebraic structures that model universal topological properties in topological phases of matter and can be regarded as mathematical characterization of topological order in two spacial dimensions. It is conjectured that…

Quantum Algebra · Mathematics 2020-12-30 Liang Wang , Zhenghan Wang

Let $p$ be a prime and $G$ a subgroup of $GL_d(p)$. We define $G$ to be $p$-exceptional if it has order divisible by $p$, but all its orbits on vectors have size coprime to $p$. We obtain a classification of $p$-exceptional linear groups.…

Group Theory · Mathematics 2014-01-21 Michael Giudici , Martin W. Liebeck , Cheryl E. Praeger , Jan Saxl , Pham Huu Tiep

In [arXiv:1006.4939] the enumeration order reducibility is defined on natural numbers. For a c.e. set A, [A] denoted the class of all subsets of natural numbers which are co-order with A. In definition 5 we redefine co-ordering for rational…

Logic in Computer Science · Computer Science 2011-02-15 Saeed Asaeedi , Farzad Didehvar

A classification theorem is obtained for a class of unital simple separable amenable Z-stable C*-algebras which exhausts all possible values of the Elliott invariant for unital stably finite simple separable amenable Z-stable C*-algebras.…

Operator Algebras · Mathematics 2021-05-05 Guihua Gong , Huaxin Lin , Z. Niu

We introduce a first-order theory $\mathsf{Seq}$ which is mutually interpretable with Robinson's $\mathsf{Q}$. The universe of a standard model for $\mathsf{Seq}$ consists of sequences. We prove that $\mathsf{Seq}$ directly interprets the…

Logic · Mathematics 2024-02-23 Lars Kristiansen , Juvenal Murwanashyaka

We introduce the notion of limiting theories, giving examples and providing a sufficient condition under which the first order theory of a structure is the limit of the first order theories of a collection of substructures. We also give a…

Logic · Mathematics 2020-07-21 Samuel M. Corson

The first-order theory of a string automatic structure is known to be decidable, but there are examples of string automatic structures with nonelementary first-order theories. We prove that the first-order theory of a string automatic…

Logic in Computer Science · Computer Science 2008-10-29 Dietrich Kuske , Markus Lohrey

For which (first-order complete, usually countable) $T$ do there exist non-isomorphic models of $T$ which become isomorphic after forcing with a forcing notion $\mathbb{P}$? Necessarily, $\mathbb{P}$ is non-trivial; i.e.~it adds some new…

Logic · Mathematics 2025-07-03 Saharon Shelah

The first-order model theory of modules has been studied for decades. More recently, the model theoretic study of nonelementary classes of modules--especially Abstract Elementary Classes of modules--has produced interesting results. This…

Logic · Mathematics 2025-07-21 Will Boney

Many open conjectures in the representation theory of finite groups can be studied by reducing them to related questions about quasi-simple groups. In such studies, $p$-radical subgroups typically play a critical role. To classify the…

Group Theory · Mathematics 2026-01-06 Meizheng Fu

We study computable embeddings for pairs of structures, i.e. for classes containing precisely two non-isomorphic structures. Surprisingly, even for some pairs of simple linear orders, computable embeddings induce a non-trivial degree…

Logic · Mathematics 2023-11-09 Nikolay Bazhenov , Hristo Ganchev , Stefan Vatev