SearcharxivSearch

arXiv · 1512.04262

Pseudo-exponential maps, variants, and quasiminimality

Abstract

We give a construction of quasiminimal fields equipped with pseudo-analytic maps, generalising Zilber's pseudo-exponential function. In particular we construct pseudo-exponential maps of simple abelian varieties, including pseudo-$\wp$-functions for elliptic curves. We show that the complex field with the corresponding analytic function is isomorphic to the pseudo-analytic version if and only the appropriate version of Schanuel's conjecture is true and the corresponding version of the strong exponential-algebraic closedness property holds. Moreover, we relativize the construction to build a model over a fairly arbitrary countable subfield and deduce that the complex exponential field is quasiminimal if it is exponentially-algebraically closed. This property asks only that the graph of exponentiation have non-trivial intersection with certain algebraic varieties but does not require genericity of these points. Furthermore Schanuel's conjecture is not required as a condition for quasiminimality.

Explore related subjects

Keep this discovery

BibTeXRIS

Martin Bays, Jonathan Kirby. 2017-03-14. Pseudo-exponential maps, variants, and quasiminimality. https://doi.org/10.2140/ant.2018.12.493

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