David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
It is a common wisdom that whereas consequence or entailment is a semantic concept, provability is a syntactic concept. However, what exactly does this mean? What is provability? In the traditional, intuitive sense, to prove something is to demonstrate its truth, and indeed the Latin word for proof is demonstratio. Hence in this sense, we cannot prove something unless it is true. Now in the course of his well known proof of the incompleteness of arithmetic, Gödel showed that provability within the axiomatic system of Peano arithmetic (PA) can be reconstructed as a number-theoretic predicate Pr and he showed that within the system there exists a statement G so that..
|Keywords||No keywords specified (fix it)|
No categories specified
(categorize this paper)
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library||
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
H. Kushida & M. Okada (2007). A Proof–Theoretic Study of the Correspondence of Hybrid Logic and Classical Logic. Journal of Logic, Language and Information 16 (1):35-61.
Max A. Freund (2001). A Temporal Logic for Sortals. Studia Logica 69 (3):351-380.
Sergei Artëmov & Franco Montagna (1994). On First-Order Theories with Provability Operator. Journal of Symbolic Logic 59 (4):1139-1153.
Hirohiko Kushida (2010). The Modal Logic of Gödel Sentences. Journal of Philosophical Logic 39 (5):577 - 590.
Konstantin N. Ignatiev (1993). On Strong Provability Predicates and the Associated Modal Logics. Journal of Symbolic Logic 58 (1):249-290.
Added to index2009-01-28
Total downloads13 ( #133,752 of 1,410,302 )
Recent downloads (6 months)2 ( #95,293 of 1,410,302 )
How can I increase my downloads?