SearcharxivSearch

arXiv · 2404.07646

$T$-convexity, Weakly Immediate Types, and $T$-$\lambda$-Spherical Completions of o-minimal Structures

Abstract

It is well known that ordered exponential fields with a compatible non-trivial valuation cannot be spherically complete, but there are some that are ``complete enough''. This paper gives analogues of Kaplansky's theorem on maximally valued fields that hold for a suitable class of elementary extensions of some ordered exponential fields with a compatible valuation. More precisely it does so for models of any theory $T_{\text{convex}}$ given by the expansion of a fixed complete o-minimal theory of ordered fields $T$, by a predicate $\mathcal{O}$ for a non-trivial $T$-convex valuation ring. For $\lambda$ an uncountable cardinal, say that a unary type $p(x)$ over a model of $T_{\text{convex}}$ is \emph{$\lambda$-bounded weakly immediate} if its cut is defined by an empty intersection of fewer than $\lambda$ many nested valuation balls. Call an elementary extension \emph{$\lambda$-bounded wim-constructible} if it is obtained as a transfinite composition of extensions each generated by one element whose type is $\lambda$-bounded weakly immediate. I show that $\lambda$-bounded wim-constructible extensions do not extend the residue-field sort and that any two wim-constructible extensions can be amalgamated in an extension which is again $\lambda$-bounded wim-constructible over both. A consequence of this is that given an uncountable cardinal $\lambda$, every model of $T_{\text{convex}}$ has a unique-up-to-isomorphism $\lambda$-spherically complete $\lambda$-bounded wim-constructible extension providing an analogue of Kaplansky's theorem. I call this extension the $T$-$\lambda$-spherical completion. Another consequence is that $T_{\mathrm{convex}}$ is \emph{definably spherically complete}. When $T$ is power bounded wim-constructible extensions are just the immediate extensions. I discuss the example of power bounded theories expanded by $\exp$ (\emph{simply exponential} theories).

Explore related subjects

Keep this discovery

BibTeXRIS

Pietro Freni. 2024-04-11. $T$-convexity, Weakly Immediate Types, and $T$-$\lambda$-Spherical Completions of o-minimal Structures. https://arxiv.org/abs/2404.07646

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