SearcharxivSearch

arXiv · 2208.00586

A note on geometric theories of fields

Abstract

Let $T$ be a complete theory of fields, possibly with extra structure. Suppose that model-theoretic algebraic closure agrees with field-theoretic algebraic closure, or more generally that model-theoretic algebraic closure has the exchange property. Then $T$ has uniform finiteness, or equivalently, it eliminates the quantifier $\exists^\infty$. It follows that very slim fields in the sense of Junker and Koenigsmann are the same thing as geometric fields in the sense of Hrushovski and Pillay. Modulo some fine print, these two concepts are also equivalent to algebraically bounded fields in the sense of van den Dries. From the proof, one gets a one-cardinal theorem for geometric theories of fields: any infinite definable set has the same cardinality as the field. We investigate whether this extends to interpretable sets. We show that positive dimensional interpretable sets must have the same cardinality as the field, but zero-dimensional interpretable sets can have smaller cardinality. As an application, we show that any geometric theory of fields has an uncountable model with only countably many finite algebraic extensions.

Explore related subjects

Keep this discovery

BibTeXRIS

Will Johnson, Jinhe Ye. 2022-08-01. A note on geometric theories of fields. https://doi.org/10.2140/mt.2023.2.121

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