SearcharxivSearch

arXiv · 2409.20295

Model Theory of Local Real Closed SV-Rings of Finite Rank

Abstract

This note begins the model-theoretic study of local real closed SV-rings of finite rank; to this end, a structure theorem for reduced local SV-rings of finite rank is given and branching ideals in local real closed rings of finite rank are analysed. The class of local real closed SV-rings of rank $ n \in \mathbb{N}^{\geq 2} $ is elementary in the language of rings $ \mathscr{L} := \{ +, -, \cdot, 0, 1 \} $ and its $ \mathscr{L} $-theory $ T_n $ has a model companion $ T_{n,1} $; models of $ T_{n,1} $ are $ n $-fold fibre products $ (((V_1 \times_{\textbf{k}} V_2) \times_{\textbf{k}}V_3) \dots \times_{\textbf{k}} V_{n-1})\times_{\textbf{k}} V_{n} $ of non-trivial real closed valuation rings $ V_i $ with isomorphic residue field $\mathbf{k}$. The $ \mathscr{L} $-theory $ T_{n,1} $ is complete, decidable, and NIP. After enriching $ \mathscr{L} $ with a predicate for the maximal ideal, models of $ T_n $ have prime extensions in models of $ T_{n,1} $, and $ T_{n,1} $ is the model completion of $ T_n $ in this enriched language. A quantifier elimination result for $ T_{n,1} $ is also given. The class of those local real closed SV-rings of rank $ n\in \mathbb{N}^{\geq 2} $ which are $ n $-fold fibre products $ (((V_1 \times_{W} V_2) \times_{W}V_3) \dots \times_{W} V_{n-1})\times_{W} V_{n} $ of non-trivial real closed valuation rings $ V_i $ along surjective morphisms $ V_i \twoheadrightarrow W $ onto a non-trivial domain $ W $ is elementary in the language of rings, and its $ \mathscr{L} $-theory $ T_{n,2} $ is also complete, decidable, and NIP; after enriching $ \mathscr{L} $ with predicates for the maximal ideal and the unique branching ideal, $ T_{n,2} $ is model complete.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ricardo Palomino Piepenborn. 2024-09-30. Model Theory of Local Real Closed SV-Rings of Finite Rank. https://arxiv.org/abs/2409.20295

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