Sequent Calculi for First-Order Strict-Tolerant Logic - Francesco Paoli (University of Cagliari)

Sequent Calculi for First-Order Strict-Tolerant Logic

Francesco Paoli (University of Cagliari)

Synergia Seminars Spring 2024

[Abstract]
Strict-Tolerant Logic (ST) underpins naïve theories of truth and vagueness (respectively including a fully disquotational truth predicate and an unrestricted tolerance principle) without jettisoning any classically valid laws. The classical sequent calculus without Cut is sometimes advocated as an appropriate proof-theoretic presentation of ST. Unfortunately, there is only a partial correspondence between its derivability relation and the relation of local metainferential ST-validity – these relations coincide only upon the addition of elimination rules and only within the propositional fragment of the calculus, due to the non-invertibility of the quantifier rules. In this talk, we present two calculi for first-order ST with an eye to recapturing this correspondence in full. The first calculus is close in spirit to the Epsilon calculus. The other calculus includes rules for the discharge of sequent-assumptions; moreover, it is normalisable and admits interpolation.