Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.23219

Models of Arbitrary Sets

Santiago Jockwich·Giorgio Venturi·Pedro Yago
View original source ↗Read source document ↗Export metadata ↓

Abstract

There is a growing literature on arbitrary objects as other types of mathematical objects, besides particular mathematical objects. In this paper we study arbitrary sets in the context of ZFC set theory. An arbitrary object is one that is determined by a state space across which it varies and by its instantiations. We compare two semantic strategies. First, we analyse the possibility of modeling arbitrary sets using direct powers of a ZFC structure. This yields a natural setting, but one where Extensionality and, crucially, the full Separation scheme fail. Second, we consider structures composed of arbitrary sets using a direct power construction evaluated in a Boolean-valued semantics. Within this setting, we develop the cumulative hierarchy of arbitrary sets, arbitrary ordinals, cardinals, and filtrations of the structure of arbitrary sets. The final section develops a combinatorial interpretation in terms of independent assignments across a fixed state space. Its connection with the iterative conception is then discussed.

Explore related subjects

math.LO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Santiago Jockwich, Giorgio Venturi, Pedro Yago. 2026-10-16. Models of Arbitrary Sets. https://arxiv.org/abs/2610.23219

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

KEEP EXPLORING

Related papers

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↗
arXiv2026

Herbrand Game Complexity

The Student-Teacher game is an extension of Herbrand's theorem. In the game, Student and Teacher take turns giving values for existentially and universally quantified variables, and Student is allowed to backtrack to propose other values for existentially quantified variables. The game has become increasingly important for proving lower bounds on provability in theories of bounded arithmetic. In those applications, the game is played in an arithmetical theory; however, this paper studies the Student-Teacher game in the setting of pure first-order logic, so it is more closely related to Herbrand's theorem and the midsequent theorem. When played in pure first-order logic, a prenex formula $ϕ$ is logically valid if and only if there is a Student-Teacher game with a winning strategy for Student for establishing $ϕ$. We present a refined version of the Student-Teacher game in arbitrary first-order universal theories and include a proof of the validity of Student-Teacher games from the sequent calculus midsequent theorem in an appendix. The game is presented as a finite tree with vertices and edges labeled by terms, and with a total order on the nodes. The totally ordered tree represents the players' interaction. Our main results show that minimal trees in the Student-Teacher game can be arbitrarily complex. Specifically, for every totally ordered tree $T$, we construct a valid prenex formula $ϕ$ such that every winning Student-Teacher game for $ϕ$ contains $T$ as a substructure. Using formulas parameterized by numerals, we prove similar results for computable and partial computable sequences of totally ordered trees. It follows not only that there is no computable bound on the size of Herbrand disjunctions, which is a well-known fact, but also that there is no computable bound on their complexity.

math.LO↗
arXiv2026

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$. The same construction also derives the following: (a) There is no maximal $C $-degree. (b) Every $n$-random real $x$ admits an $n$-random real $y$ such that $y>_Kx$ and $y>_C x$; moreover, the difference of $K$-complexity and $C$-complexity of $y,x$ (namely $K(y\upharpoonright n)-K(x\upharpoonright n)$ and $C(y\upharpoonright n)-C(x\upharpoonright n)$) do not tend to infinity.

math.LO↗