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

07/14/2020
by   Martin Fischer, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/24/2021

Truth and Subjunctive Theories of Knowledge: No Luck?

The paper explores applications of Kripke's theory of truth to semantics...
research
02/26/2018

A Finite-Model-Theoretic View on Propositional Proof Complexity

We establish new, and surprisingly tight, connections between propositio...
research
01/05/2023

Defining Logical Systems via Algebraic Constraints on Proofs

We provide a comprehensive presentation of a program of uniform decompos...
research
07/12/2021

Separating LREC from LFP

LREC= is an extension of first-order logic with a logarithmic recursion ...
research
07/22/2002

Nonmonotonic Probabilistic Logics between Model-Theoretic Probabilistic Logic and Probabilistic Logic under Coherence

Recently, it has been shown that probabilistic entailment under coherenc...
research
04/14/2022

Dunn Semantics for Contra-Classical Logics

In this paper I show, with a rich and systematized diet of examples, tha...
research
07/02/2022

What Makes a Strong Monad?

Strong monads are important for several applications, in particular, in ...

Please sign up or login with your details

Forgot password? Click here to reset