NOTES ON BOUNDED INDUCTION FOR THE COMPOSITIONAL TRUTH PREDICATE

DOI10.1017/S1755020316000368zbMath1421.03028arXiv1712.00470MaRDI QIDQ5357325

Mateusz Łełyk, Bartosz Wcisło

Publication date: 15 September 2017

Published in: The Review of Symbolic Logic (Search for Journal in Brave)

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

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Relative consistency and interpretations (03F25)

Related Items (11)

Reflection algebras and conservation results for theories of iterated truth ⋮ Local collection and end-extensions of models of compositional truth ⋮ The two halves of disjunctive correctness ⋮ TRUTH AND FEASIBLE REDUCIBILITY ⋮ MODEL THEORY AND PROOF THEORY OF THE GLOBAL REFLECTION PRINCIPLE ⋮ Compositional truth with propositional tautologies and quantifier-free correctness ⋮ Pathologies in satisfaction classes ⋮ The implicit commitment of arithmetical theories and its semantic core ⋮ Truth, disjunction, and induction ⋮ Truth and the philosophy of mathematics ⋮ FINITIST AXIOMATIC TRUTH

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Relative Truth Definability of Axiomatic Truth Theories
• CONSERVATIVITY FOR THEORIES OF COMPOSITIONAL TRUTH VIA CUT ELIMINATION
• Bounded Induction and Satisfaction Classes
• Construction of Satisfaction Classes for Nonstandard Models

This page was built for publication: NOTES ON BOUNDED INDUCTION FOR THE COMPOSITIONAL TRUTH PREDICATE