Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 0709.2979

Choice and Regularity: Common Consequences in Logic

Denis I. Saveliev
View original source ↗Read source document ↗Export metadata ↓

Abstract

It is well-known that Choice and Regularity are independent of each other but have important common consequences of logical character (reflection principles, representations of classes by sets, etc.). We explain this phenomenon by isolating their "intersection", a principle (called here Best-Foundedness) which is consistent with the negations of both axioms but implies all these consequences. Then we study relationships between these consequences (and near principles) in detail. Finally, we consider some arguments related to truth of various principles in set theory, especially arguments concerning the interpretability strength.

Explore related subjects

math.LO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Denis I. Saveliev. 2007-09-19. Choice and Regularity: Common Consequences in Logic. https://arxiv.org/abs/0709.2979

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

KEEP EXPLORING

Related papers

arXiv2026

Measuring the complexity of characterizing $[0, 1]$, $S^1$, and $\mathbb{R}$ up to homeomorphism

In analogy to the study of Scott rank/complexity of countable structures, we initiate the study of the Wadge degrees of the set of homeomorphic copies of topological spaces. One can view our results as saying that the classical characterizations of $[0,1]$ (e.g., as the unique continuum with exactly two non-cut points, and other similar characterizations), appropriated expressed, are the simplest possible characterizations of $[0,1]$. Formally, we show that the set of homeomorphic copies of $[0,1]$ is $\mathbfΠ^0_4$-Wadge-complete. We also show that the set of homeomorphic copies of $S^1$ is $\mathbfΠ^0_4$-Wadge-complete. On the other hand, we show that the set of homeomorphic copies of $\mathbb{R}$ is $\mathbfΠ^1_1$-Wadge-complete. It is the local compactness that cannot be expressed in a Borel way; the set of homeomorphic copies of $\mathbb{R}$ is $\mathbfΠ^0_4$-Wadge-complete within the locally compact spaces.

math.LO↗
arXiv2026

Loops, Inverse Limits and Non-Determinism

We introduce an operator on problems in Weihrauch complexity, which we call the infinite loop or inverse limit, and which corresponds to an infinite compositional product. This operation arises naturally whenever one implements algorithms that produce a sequence of results in an infinite loop, using some fixed subroutine. We prove that the corresponding operator is monotone with respect to (strong) Weihrauch reducibility but that it is not a closure operator. One of our findings is that weak KÅ‘nig's lemma is closed under infinite loops, which implies that the class of non-deterministically computable problems is also closed under this operation. Consequently, this class allows for a high degree of flexibility in programming. As our main technical tools, we present an injective version of the recursion theorem and an infinitary version of the so-called independent choice theorem. We also show that, in general, the infinite loop operator is more powerful than the composition of the diamond operator followed by the parallelization operator. However, in many practical scenarios, these compositions yield a result, which coincides with the application of the infinite loop operator. Finally, we discuss the special situation of loops for single-valued problems and for problems on Turing degrees.

math.LO↗