Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2410.12471

Axiomatic theories of supervaluational truth: completing the picture

Pablo Dopico·Daichi Hayashi
View original source ↗Read source document ↗Export metadata ↓

Abstract

Supervaluational fixed-point theories of formal truth aim to amend an important shortcoming of fixed-point theories based on the Strong Kleene logic, namely, accounting for the truth of classical validities. In a celebrated paper, Andrea Cantini proposed an axiomatization of one such supervaluational theory of truth, which he called VF, and which proved to be incredibly strong proof-theoretically speaking. However, VF only axiomatizes one in a collection of several supervaluational schemes, namely the scheme which requires truth to be consistent. In this paper, we provide axiomatic theories for the remaining supervaluational schemes, labelling these systems VF$^-$ (for the theory which drops the consistency requirement), and VFM (for the theory which requires not only consistency but also completeness, i.e., maximal consistency). We then carry out proof-theoretic analyses of both theories. Our results show that VF$^-$ is as strong as VF, but that VFM's strength decreases significantly, being only as strong as the well-known theory KF. Furthermore, we introduce and analyse proof-theoretically two variants of these theories: the schematic extension, in the sense of Feferman, of VFM; and a theory in-between VFM and VF, that we call VFW, and which drops the assumption of maximal consistency. The former is shown to match the strength of predicative analysis; for the latter, we show its proof-theoretical equivalence with ramified analysis up to the ordinal $\varphi_20$, thus standing halfway between VFM and VF.

Explore related subjects

math.LO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Pablo Dopico, Daichi Hayashi. 2024-10-16. Axiomatic theories of supervaluational truth: completing the picture. https://arxiv.org/abs/2410.12471

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

KEEP EXPLORING

Related papers

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$.

math.LO↗
arXiv2026

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO↗
arXiv2026

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO↗