Abstract
Ali Enayat had asked whether two halves of Disjunctive Correctness ([Formula: see text]) for the compositional truth predicate are conservative over Peano Arithmetic (PA). In this paper, we show that the principle “every true disjunction has a true disjunct” is equivalent to bounded induction for the compositional truth predicate and thus it is not conservative. On the other hand, the converse implication “any disjunction with a true disjunct is true” can be conservatively added to [Formula: see text]. The methods introduced here allow us to give a direct nonconservativeness proof for [Formula: see text].
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.