Affiliation:
1. Computer Science, Graduate Center City, University of New York, 365 Fifth Avenue, New York, NY 10016, USA
Abstract
Abstract
Artemov (2019, The provability of consistency) offered the notion of constructive truth and falsity of arithmetical sentences 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 in Peano arithmetic where $n$ is any positive natural number. Based on this generalization, we also analyse the logical status of well-known Gödelean sentences: consistency assertions for extensions of PA, the local reflection principles, the ‘constructive’ liar sentences and Rosser sentences. Finally, we discuss ‘extremely’ independent sentences in the sense that they are classically true but neither constructively true nor $n$-constructively false for any $n$.
Publisher
Oxford University Press (OUP)
Subject
Logic,Hardware and Architecture,Arts and Humanities (miscellaneous),Software,Theoretical Computer Science
Reference21 articles.
1. Arithmetically complete modal theories;Artemov,1980
2. Operational Modal Logic;Artemov,1995
3. Explicit provability and constructive semantics;Artemov;The Bulletin of Symbolic Logic,2001
4. The provability of consistency;Artemov,2019
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献