Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.24683

Model Theory of Products of Chains

Miloš S. Kurilić
View original source ↗Read source document ↗Export metadata ↓

Abstract

We show that regarding the model-theoretic properties of distributive lattices isomorphic to finite products of linear orders there is a significant symmetry: if ${\mathbb X}_i$, $i 1$, ${\mathcal T}:=\mathop{\rm Th}\nolimits (\prod _{i 1$ is first order definable.

Explore related subjects

math.LO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Miloš S. Kurilić. 2026-10-17. Model Theory of Products of Chains. https://arxiv.org/abs/2610.24683

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Weakly uniform computable categoricity and function composition

We introduce the definition of a weakly $X$-uniformly $Y$-computably categorical structure, relativizing a definition of Kudinov (1996), and show that this relativized notion is closely related to the 2-dimensional complexity of the pairs of partial functions $(f,g)$ with the property that the composition $g\circ f$ simulates convergent $\emptyset'$-oracle computations. We develop a general theory for computing via composition and use it to prove results about the surprisingly complex weakly uniform categoricity spectrum of the structure $(ω,S)$ where $S(n)=n+1$. Namely, that $(ω,S)$ is w.$X$.u.$Y$.c.c. for some $X\not\geq_T\emptyset'$ and $Y<_T\emptyset'$, but $(ω,S)$ is not w.$X$.u.$Y$.c.c. for any $X<_T\emptyset'$ and $Y\not\geq_T\emptyset'$. We also construct a computably categorical structure that is not w.$\emptyset'$.u.c.c., but is w.$X$.u.c.c. for a set $X$ that is $\leq_T$-incomparable with $\emptyset'$.

math.LO↗
arXiv2026

Short proof that Vopěnka's Principle is symmetrically stable

We show that Vopěnka's Principle is stable under symmetric extensions. Recently, de Groot and Woloszyn [1] proved this fact. We found the proof of this theorem unnecessarily complicated. In this short note we prove the same statement. We direct the reader to [3] for an exposition on symmetric extensions.

math.LO↗
arXiv2026

Schnorr Randomness and Effective Bayesian Consistency and Inconsistency

We study Doob's Consistency Theorem and Freedman's Inconsistency Theorem from the vantage point of computable probability and algorithmic randomness. We show that the Schnorr random elements of the parameter space are computably consistent, when there is a map from the sample space to the parameter space satisfying many of the same properties as limiting relative frequencies. We show that the generic inconsistency in Freedman's Theorem is effectively comeager, which implies the existence of computable parameters which are not computably consistent. Taken together, this work provides a computability-theoretic solution to Diaconis and Freedman's problem of ``know[ing] for which [parameters] the rule [Bayes' rule] is consistent'', and it strengthens recent similar results of Takahashi on Martin-Löf randomness in Cantor space.

math.LO↗