Conservativity for theories of compositional truth via cut elimination

DOI10.1017/JSL.2015.27MaRDI QIDQ3450806zbMATHOpenAlexFDO

Authors Graham E. Leigh

Publication date 9 November 2015

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1308.0168

zbMATH Keywords

cut eliminationtruth predicatescompositional axioms for truth

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) First-order arithmetic and fragments (03F30)

Abstract: We present a cut elimination argument that witnesses the conservativity of the compositional axioms for truth (without the extended induction axiom) over any theory interpreting a weak subsystem of arithmetic. In doing so we also fix a critical error in Halbach's original presentation. Our methods show that the admission of these axioms determines a hyper-exponential reduction in the size of derivations of truth-free statements.

Recommendations

• TRUTH AND FEASIBLE REDUCIBILITY
• Conservative theories of classical truth
• Notes on bounded induction for the compositional truth predicate
• Truth, disjunction, and induction
• A note on typed truth and consistency assertions

Cites work

• scientific article; zbMATH DE number 3494394 (Why is no real title available?)
• A proof-theoretic account of classical principles of truth
• An axiomatic approach to self-referential truth
• An ordinal analysis for theories of self-referential truth
• Axiomatic theories of truth
• Bounded Induction and Satisfaction Classes
• Conservative theories of classical truth
• Construction of Satisfaction Classes for Nonstandard Models
• Minimal truth and interpretability
• Set theory and hierarchy theory. A memorial tribute to Andrzej Mostowski, Bierutowice, Poland 1975

Cited in

(20)

• Reflecting and unfolding
• On cut-elimination arguments for axiomatic theories of truth
• Interpreting the compositional truth predicate in models of arithmetic
• Lindenbaum's lemma via open induction
• Equivalences for truth predicates
• Models of weak theories of truth
• Local collection and end-extensions of models of compositional truth
• The implicit commitment of arithmetical theories and its semantic core
• About Truth and Types
• Truth and the philosophy of mathematics
• Truth and speed-up
• AXIOMATIZATIONS OF PEANO ARITHMETIC: A TRUTH-THEORETIC VIEW
• More on Systems of Truth and Predicative Comprehension
• The two halves of disjunctive correctness
• MODEL THEORY AND PROOF THEORY OF THE GLOBAL REFLECTION PRINCIPLE
• TRUTH AND FEASIBLE REDUCIBILITY
• The logical strength of compositional principles
• Truth, disjunction, and induction
• Cut elimination for systems of transparent truth with restricted initial sequents
• Notes on bounded induction for the compositional truth predicate

This page was built for publication: Conservativity for theories of compositional truth via cut elimination

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3450806)