Notes on bounded induction for the compositional truth predicate

DOI10.1017/S1755020316000368MaRDI QIDQ5357325zbMATH OpenFDO

Authors Bartosz Wcisło, Mateusz Łełyk

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

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

Abstract: We prove that the theory of the extensional compositional truth predicate for the language of arithmetic with $Delt{a}_0$-induction scheme for the truth predicate and the full arithmetical induction scheme is not conservative over Peano Arithmetic. In addition, we show that a slightly modified theory of truth actually proves the global reflection principle over the base theory.

Recommendations

• Truth, disjunction, and induction
• Notes on Formal Theories of Truth
• Local collection and end-extensions of models of compositional truth
• An axiomatic approach to self-referential truth
• Models of \(\mathrm{PT}^-\) with internal induction for total formulae

Cites work

• Axiomatic theories of truth
• Bounded Induction and Satisfaction Classes
• Conservativity for theories of compositional truth via cut elimination
• Construction of Satisfaction Classes for Nonstandard Models
• scientific article; zbMATH DE number 51556 (Why is no real title available?)
• scientific article; zbMATH DE number 1144041 (Why is no real title available?)
• Relative Truth Definability of Axiomatic Truth Theories
• The structure of models of Peano arithmetic

Cited in

(17)

• The implicit commitment of arithmetical theories and its semantic core
• Truth and the philosophy of mathematics
• Reflection algebras and conservation results for theories of iterated truth
• Truth, disjunction, and induction
• Local collection and end-extensions of models of compositional truth
• A theory of formal truth arithmetically equivalent to ID₁
• Conservativity for theories of compositional truth via cut elimination
• TRUTH AND FEASIBLE REDUCIBILITY
• Models of \(\mathrm{PT}^-\) with internal induction for total formulae
• FINITIST AXIOMATIC TRUTH
• The two halves of disjunctive correctness
• MODEL THEORY AND PROOF THEORY OF THE GLOBAL REFLECTION PRINCIPLE
• Compositional truth with propositional tautologies and quantifier-free correctness
• Pathologies in satisfaction classes
• Indiscernibles and satisfaction classes in arithmetic
• Saturation properties for compositional truth with propositional correctness
• Satisfaction classes with approximate disjunctive correctness

This page was built for publication: Notes on bounded induction for the compositional truth predicate

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