Search arXivSearch

arXiv · 2201.03534

Interpolative fusions II: Preservation results

Abstract

We study interpolative fusion, a method of combining theories $T_1$ and $T_2$ in distinct languages in a "generic" way over a common reduct $T_\cap$, to obtain a theory $T_\cup^*$. When each $T_i$ is model-complete, $T_\cup^*$ is the model companion of the union $T_1\cup T_2$. Our goal is to prove preservation results, i.e., to find sufficient conditions under which model-theoretic properties of $T_1$ and $T_2$ are inherited by $T_\cup^*$. We first prove preservation results for quantifier elimination, model-completeness, and related properties. We then apply these tools to show that, under mild hypotheses, including stability of $T_\cap$, the property $\mathrm{NSOP}_1$ is preserved. We also show that simplicity is preserved under stronger hypotheses on algebraic closure in $T_1$ and $T_2$. This generalizes many previous results; for example, simplicity of $\mathrm{ACFA}$ and the random $n$-hypergraph are both non-obvious corollaries. We also address preservation of stability, $\mathrm{NIP}$, and $\aleph_0$-categoricity, and we describe examples which witness that these results are sharp.

Explore related subjects

Keep this discovery

BibTeXRIS

Alex Kruckman, Minh Chieu Tran, Erik Walsberg. 2022-01-10. Interpolative fusions II: Preservation results. https://arxiv.org/abs/2201.03534

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

KEEP EXPLORING

Related papers

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

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

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