Back to Search
Start Over
PROVING UNPROVABILITY.
- Source :
-
Review of Symbolic Logic . Mar2017, Vol. 10 Issue 1, p92-115. 24p. - Publication Year :
- 2017
-
Abstract
- This paper addresses the question: given some theory T that we accept, is there some natural, generally applicable way of extending T to a theory S that can prove a range of things about what it itself (i.e., S) can prove, including a range of things about what it cannot prove, such as claims to the effect that it cannot prove certain particular sentences (e.g., 0 = 1), or the claim that it is consistent? Typical characterizations of Gödel’s second incompleteness theorem, and its significance, would lead us to believe that the answer is ‘no’. But the present paper explores a positive answer. The general approach is to follow the lead of recent (and not so recent) approaches to truth and the Liar paradox. [ABSTRACT FROM PUBLISHER]
- Subjects :
- *INCOMPLETENESS theorems
*MATHEMATICS theorems
*GODEL'S theorem
*LIAR paradox
Subjects
Details
- Language :
- English
- ISSN :
- 17550203
- Volume :
- 10
- Issue :
- 1
- Database :
- Academic Search Index
- Journal :
- Review of Symbolic Logic
- Publication Type :
- Academic Journal
- Accession number :
- 121563291
- Full Text :
- https://doi.org/10.1017/S1755020316000216