Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2212.11859

Librationism & its classical and extraclassical set theories

Frode A. Bjørdal
View original source ↗Read source document ↗Export metadata ↓

Abstract

Librationist set theory £${}$ is developed. It descends from semantics for truth, initiated by Kripke, and others. # extends £, of Librationist closures of the paradoxes in Logic and Logical Philosophy 21(4), 323-361, 2012. Focus is on the paradoxes in theories of sets. A central result is that extension #$\mathscr{HR}(\mathbf{G})$, of #, accounts for $\mathbf{NBG}$ set theory, with global AC and Tarski's Axiom. # succeeds with defining an impredicative manifestation set $\mathbf{W}$, $\mathit{die \ Welt}$, so that #$\mathscr{H}(\mathbf{W})$ accounts for Quine's $\mathbf{NF}$. The points of view developed support the view that the truth-paradoxes and the set-paradoxes often have common origins, so that the librationist resolutions of set theoretic paradoxes are in some cases at the same time resolutions of corresponding truth theoretic paradoxes. Librationist set theories have the consequence that there are absolutely no uncountable sets, and so # retains the ideology of the author's 2012 article, that the set theoretic universe is countable. But the set within which e.g. $\mathbf{NBG}$ is interpreted "believes" that there are sets which are uncountable. That situation is analyzed almost as by Skolem, though it is not suggested that the notion of $\mathit{set}$ is imprecise: for the bijection from the set of finite von Neumann ordinals to the full universe is not a member of a classical set theory. The Diagonal Lemma is derivable; but the truth predicate of the system only fulfills slightly reformed Hilbert-Bernays-Löb derivability conditions, so the Löb rule for truth is not valid.

Explore related subjects

math.LO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Frode A. Bjørdal. 2025-05-12. Librationism & its classical and extraclassical set theories. https://arxiv.org/abs/2212.11859

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

KEEP EXPLORING

Related papers

arXiv2026

On n-dependent groups and fields III. Multilinear forms and invariant connected components

We develop some model theory of multilinear forms, generalizing Granger's work in the bilinear case. In particular, after proving a quantifier elimination result, we show that for an NIP field $K$, the theory of infinite-dimensional non-degenerate alternating $n$-linear spaces over $K$ is strictly $n$-dependent, and is NSOP$_1$ if $K$ is. These results rely on a new Composition Lemma for functions of arbitrary arity and NIP relations (which in turn relies on certain higher-arity generalizations of the Sauer--Shelah lemma). We also study the invariant connected components $G^{\infty}$ in $n$-dependent groups, demonstrating their relative absoluteness.

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

A vector logic for intensional formal semantics

Formal semantics and distributional semantics are distinct approaches to linguistic meaning: the former models meaning as reference via model-theoretic structures; the latter as vectors in high-dimensional spaces shaped by usage. This paper establishes which part of intensional formal semantics admits a linear vector-space encoding. Kripke-style intensional models, with any finite collection of index sorts collected in a compound index space, embed injectively into vector spaces: primitive domains go to free carriers; intensions and other functions go to linear operators. Semantic functions lift to unique multilinear maps on the free carriers, and composition is preserved. The operator encoding of a function domain compresses its free carrier, and we characterize the functionals: a Boolean-valued functional of a power set acts linearly on operator encodings exactly when it is constant, an ultrafilter indicator, or the complement of one, so that on finite domains the nonconstant ones are Montague's individuals and their negations. Determiners over a restrictor of two or more elements, modal operators over two or more accessible indices, and attitude operators over two or more alternatives are outside the linear regime, and take, instead, the form of a linear accumulation followed by a decision. Modality is defined uniformly over measure frames, in which counting measure recovers Kripke semantics at every cardinality, and continuous measures make necessity truth almost everywhere; we give the correspondence conditions for the axioms D, T, B, 4, and 5 under measures, the Kronecker factorization of accessibility over compound indices, and the reading of measure-based modality as graded modality.

math.LO↗