Compositional truth with propositional tautologies and quantifier-free correctness
From MaRDI portal
Abstract: Cie'sli'nski asked whether compositional truth theory with the additional axiom that all propositional tautologies are true is conservative over Peano Arithmetic. We provide a partial answer to this question, showing that if we additionally assume that truth predicate agrees with arithmetical truth on quantifier-free sentences, the resulting theory is as strong as -induction for the compositional truth predicate, hence non-conservative. On the other hand, it can be shown with a routine argument that the principle of quantifier-free correctness is itself conservative.
Recommendations
Cites work
- Axiomatic theories of truth
- Construction of Satisfaction Classes for Nonstandard Models
- Deflationary truth and pathologies
- DISJUNCTIONS WITH STOPPING CONDITIONS
- Handbook of philosophical logic. Vol. 5
- scientific article; zbMATH DE number 51556 (Why is no real title available?)
- scientific article; zbMATH DE number 227056 (Why is no real title available?)
- Local collection and end-extensions of models of compositional truth
- Nonstandard definability
- Notes on bounded induction for the compositional truth predicate
- The two halves of disjunctive correctness
- Truth, disjunction, and induction
Cited in
(2)
This page was built for publication: Compositional truth with propositional tautologies and quantifier-free correctness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6139242)