Search arXivSearch

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

Bluebirds and mockingbirds cannot produce a fixed-point combinator

Let $B$ be the bluebird combinator with reduction rule $Bxyz \to_{w} x\left(yz\right)$, let $M$ be the mockingbird combinator with reduction rule $Mx \to_{w} xx$, and let $I$ be the identity bird combinator with reduction rule $Ix \to_{w} x$. A fixed-point combinator, called a sage bird by Smullyan, is a closed term $Y$ such that, for a fresh variable $x$, $Yx$ is equivalent to $x\left(Yx\right)$ under these reduction rules. For a fixed variable $x$, we construct an invariant $\mathrm{Tr}_{x}\left(u\right)$ of a $BMI$-term $u$ with respect to $\to_{w}$. This invariant traces the occurrences of $x$ in the leftmost-innermost reduction sequence of $u$. We then prove that $\mathrm{Tr}_{x}\left(Yx\right) \neq \mathrm{Tr}_{x}\left(x^{r}\left( Yx \right)\right)$ for every $x$-free $BMI$-term $Y$ and every $r\geq 1$. Consequently, there exists no fixed-point combinator in $BMI$-combinatory logic. This provides a negative answer to the problem posed by Smullyan in 1985.

math.LO

Pointwise provable equality and the failure of composition

Montagna (1989) and Di Paola--Montagna (1991) claim that the algebraic systems $S'$ and $S'_T$, respectively, are categories. We show that the proposed composition is not independent of the choice of representatives. For every consistent recursively enumerable extension $T$ of Peano arithmetic ($\mathrm{PA}$), we exhibit two program indices that are pointwise provably equal in $T$ but yield inequivalent composites when each is run after the same program. Montagna's $S'$ is the case $T=\mathrm{PA}$. The failure already occurs for partial maps from $ω$ to itself. Weak totality and the proposed range assignment also depend on the choice of representatives. More generally, for consistent $T\supseteq\mathrm{PA}$, pointwise provable equality is a composition congruence exactly when $T$ proves every true $Π^0_1$ sentence, in which case it is extensional equality. This completeness condition fails for every consistent recursively enumerable $T\supseteq\mathrm{PA}$ by Gödel's second incompleteness theorem. For every extension $T\supseteq\mathrm{PA}$, the least composition congruence containing pointwise provable equality is extensional equality if $T$ is $Σ^0_1$-sound and the universal relation otherwise.

math.LO

Compactness via Consistency Properties

We will use consistency properties to characterize strongly compact cardinals, first showing an adequate Model Existence Theorem for larger fragments.

math.LO