Cut elimination for systems of transparent truth with restricted initial sequents

Download Edit this record How to cite View on PhilPapers
Abstract
The paper studies a cluster of systems for fully disquotational truth based on the restriction of initial sequents. Unlike well-known alternative approaches, such systems display both a simple and intuitive model theory and remarkable proof-theoretic properties. We start by showing that, due to a strong form of invertibility of the truth rules, cut is eliminable in the systems via a standard strategy supplemented by a suitable measure of the number of applications of truth rules to formulas in derivations. Next, we notice that cut remains eliminable when suitable arithmetical axioms are added to the system. Finally, we establish a direct link between cut-free derivability in infinitary formulations of the systems considered and fixed-point semantics. Noticeably, unlike what happens with other background logics, such links are established without imposing any restriction to the premisses of the truth rules.
PhilPapers/Archive ID
NICCEF-2
Upload history
First archival date: 2020-06-14
Latest version: 2 (2020-06-28)
View other versions
Added to PP index
2020-06-14

Total views
79 ( #37,246 of 51,557 )

Recent downloads (6 months)
79 ( #6,248 of 51,557 )

How can I increase my downloads?

Downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.