Papers
Topics
Authors
Recent
Search
2000 character limit reached

Axiomatic theories of supervaluational truth: completing the picture

Published 16 Oct 2024 in math.LO | (2410.12471v1)

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.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.