English

Nonclassical truth with classical strength. A proof-theoretic analysis of compositional truth over HYPE

Logic 2020-08-14 v3 Logic in Computer Science

Abstract

Questions concerning the proof-theoretic strength of classical versus non-classical theories of truth have received some attention recently. A particularly convenient case study concerns classical and nonclassical axiomatizations of fixed-point semantics. It is known that nonclassical axiomatizations in four- or three-valued logics are substantially weaker than their classical counterparts. In this paper we consider the addition of a suitable conditional to First-Degree Entailment -- a logic recently studied by Hannes Leitgeb under the label `HYPE'. We show in particular that, by formulating the theory PKF over HYPE one obtains a theory that is sound with respect to fixed-point models, while being proof-theoretically on a par with its classical counterpart KF. Moreover, we establish that also its schematic extension -- in the sense of Feferman -- is as strong as the schematic extension of KF, thus matching the strength of predicative analysis.

Keywords

Cite

@article{arxiv.2007.07188,
  title  = {Nonclassical truth with classical strength. A proof-theoretic analysis of compositional truth over HYPE},
  author = {Martin Fischer and Carlo Nicolai and Pablo Dopico Fernandez},
  journal= {arXiv preprint arXiv:2007.07188},
  year   = {2020}
}

Comments

Fixed a gap in the proof of the lower bound for KFL^*

R2 v1 2026-06-23T17:07:02.072Z