Companionability Characterization for the Expansion of an O-minimal Theory by a Dense Subgroup

Alexi Block Gorman

Home/Archive/arXiv

arXiv · 2003.06366

Companionability Characterization for the Expansion of an O-minimal Theory by a Dense Subgroup

Alexi Block Gorman

View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper provides a full characterization for when the expansion of a complete o-minimal theory by a unary predicate that picks out a divisible dense and codense subgroup has a model companion. This result is motivated by criteria and questions introduced in the recent works concerning the existence of model companions, as well as preservation results for some neostability properties when passing to the model companion. The focus of this paper is establishing the companionability dividing line in the o-minimal setting because this allows us to provide a full and geometric characterization. Examples are included both in which the predicate is an additive subgroup, and where it is a multiplicative subgroup. The paper concludes with a brief discussion of neostability properties and examples that illustrate the lack of preservation (from the "base" o-minimal theory to the model companion of the expansion we define) for properties such as strong, NIP, and NTP$_2$, though there are also examples for which some or all three of those properties hold.

Explore related subjects

math.LO

Keep this discovery

BibTeX RIS

Alexi Block Gorman. 2020-03-13. Companionability Characterization for the Expansion of an O-minimal Theory by a Dense Subgroup. https://arxiv.org/abs/2003.06366

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO↗

arXiv2026

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO↗

arXiv2026

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO↗