SearcharxivSearch

arXiv · 2208.05815

Around definable types in $p$-adically closed fields

Abstract

We prove some technical results on definable types in $p$-adically closed fields, with consequences for definable groups and definable topological spaces. First, the code of a definable $n$-type (in the field sort) can be taken to be a real tuple (in the field sort) rather than an imaginary tuple (in the geometric sorts). Second, any definable type in the real or imaginary sorts is generated by a countable union of chains parameterized by the value group. Third, if $X$ is an interpretable set, then the space of global definable types on $X$ is strictly pro-interpretable, building off work of Cubides Kovacsics, Hils, and Ye. Fourth, global definable types can be lifted (in a non-canonical way) along interpretable surjections. Fifth, if $G$ is a definable group with definable f-generics ($dfg$), and $G$ acts on a definable set $X$, then the quotient space $X/G$ is definable, not just interpretable. This explains some phenomena observed by Pillay and Yao. Lastly, we show that interpretable topological spaces satisfy analogues of first-countability and curve selection. Using this, we show that all reasonable notions of definable compactness agree on interpretable topological spaces, and that definable compactness is definable in families.

Explore related subjects

Keep this discovery

BibTeXRIS

Pablo Andujar Guerrero, Will Johnson. 2022-08-11. Around definable types in $p$-adically closed fields. https://doi.org/10.1016/j.apal.2024.103484

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