Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 0910.0683

Grouplike minimal sets in ACFA and in T_A

Alice Medvedev
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper began as a generalization of a part of the author's PhD thesis about ACFA and ended up with a characterization of groups definable in T_A. The thesis concerns minimal formulae in ACFA of the form "p lies on an algebraic curve A and s(x)=f(x)" for some dominant rational function f from A to s(A), where s is the automorphism. These are shown to be uniform in the Zilber trichotomy, and the pairs (A,f) that fall into each of the three cases are characterized. These characterizations are definable in families. This paper covers approximately half of the thesis, namely those parts of it which can be made purely model-theoretic by moving from ACFA, the model companion of the class of algebraically closed fields with an endomorphism, to T_A, the model companion of the class of models of an arbitrary totally-transcendental theory T with an injective endomorphism, if this model-companion exists. A T_A analog of the characterization of groups definable in ACFA is obtained in the process. The full characterization is obtained from these intermediate results with heavy use of algebraic geometry: see the thesis or the forthcoming paper "Around Lattes functions".

Explore related subjects

math.LO

Keep this discovery

BibTeXRIS

Alice Medvedev. 2010-02-17. Grouplike minimal sets in ACFA and in T_A. https://arxiv.org/abs/0910.0683

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↗