On the constructive truth and falsity in Peano arithmetic

DOI10.1007/978-3-030-36755-8_5zbMATH Open1485.03250arXiv1905.10494OpenAlexW2995027571MaRDI QIDQ2177579FDOQ2177579

Authors: Hirohiko Kushida 

Publication date: 6 May 2020

Abstract: Recently, Artemov [4] offered the notion of constructive consistency for Peano Arithmetic and generalized it to constructive truth and falsity in the spirit of Brouwer-Heyting-Kolmogorov semantics and its formalization, the Logic of Proofs. In this paper, we provide a complete description of constructive truth and falsity for Friedman's constant fragment of Peano Arithmetic. For this purpose, we generalize the constructive falsity to n-constructive falsity where n is any positive natural number. We also establish similar classification results for constructive truth and n-constructive falsity of Friedman's formulas. Then, we discuss `extremely' independent sentences in the sense that they are classically true but %unprovable in Peano Arithmetic neither constructively true nor n-constructive false for any n.

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

Recommendations

• Constructive truth and falsity in Peano arithmetic
• A note of provability, truth and existence
• Closed Fragments of Provability Logics of Constructive Theories
• Constructive validity is nonarithmetic
• On the Proof Method for Constructive Falsity

zbMATH Keywords

foundations of mathematicsmodal logicPeano arithmetic

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Metamathematics of constructive systems (03F50)

Cited In (3)

• Constructive validity is nonarithmetic
• Peirce's Truth-functional Analysis and the Origin of the Truth Table
• Constructive truth and falsity in Peano arithmetic

This page was built for publication: On the constructive truth and falsity in Peano arithmetic

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