Name
Abstract | ||
|---|---|---|
A Godel sentence is often described as a sentence saying about itself that it is not provable, and a Henkin sentence as a sentence stating its own provability. We discuss what it could mean for a sentence of arithmetic to ascribe to itself a property such as provability or unprovability. The starting point will be the answer Kreisel gave to Henkin's problem. We describe how the properties of the supposedly self-referential sentences depend on the chosen coding, the formulae expressing the properties and the way a fixed points for the formulae are obtained. This paper is the first of two papers. In the present paper we focus on provability. In part II, we will consider other properties like Rosser provability and partial truth predicates. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1017/S1755020314000288 | REVIEW OF SYMBOLIC LOGIC |
Keywords | Field | DocType |
intensionality,philosophy,logic,self reference | Arithmetic,Self-reference,Algorithm,Coding (social sciences),Predicate (grammar),Fixed point,Sentence,Mathematics | Journal |
Volume | Issue | ISSN |
7 | 4 | 1755-0203 |
Citations | PageRank | References |
1 | 0.41 | 10 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Volker Halbach | 1 | 87 | 10.29 |
| Albert Visser | 2 | 77 | 15.04 |