$\mathbb{Q}$ACFA

Alice Medvedev

Home/Archive/arXiv

arXiv · 1508.06007

$\mathbb{Q}$ACFA

Alice Medvedev

View original source ↗Read source document ↗Export metadata ↓

Abstract

We show that many nice properties of a theory $T$ follow from the corresponding properties of its reducts to finite subsignatures. If $\{ T_i \}_{i \in I}$ is a directed family of conservative expansions of first-order theories and each $T_i$ is stable (respectively, simple, rosy, dependent, submodel complete, model complete, companionable), then so is the union $T := \cup_i T_i$. In most cases, (thorn)-forking in $T$ is equivalent to (thorn)-forking of algebraic closures in some $T_i$. This applies to fields with an action by $(\mathbb{Q}, +)$, whose reducts to finite subsignatures are interdefinable with the theory of fields with one automorphism. We show that the model companion $\mathbb{Q}$ACFA of this theory is strictly simple and has the same level of quantifier elimination and the same algebraic characterization of algebraic closure and forking independence as ACFA. The lattice of the fixed fields of the named automorphisms breaks supersimplicity in $\mathbb{Q}$ACFA, but away from these we find many (weakly) minimal formulas.

Explore related subjects

math.LO

Keep this discovery

BibTeX RIS

Alice Medvedev. 2015-08-25. $\mathbb{Q}$ACFA. https://arxiv.org/abs/1508.06007

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↗