10 ideas
| 17892 | For clear questions posed by reason, reason can also find clear answers [Gödel] |
| Full Idea: I uphold the belief that for clear questions posed by reason, reason can also find clear answers. | |
| From: Kurt Gödel (works [1930]), quoted by Peter Koellner - On the Question of Absolute Undecidability 1.5 | |
| A reaction: [written in 1961] This contradicts the implication normally taken from his much earlier Incompleteness Theorems. |
| 13831 | Logic is based on transitions between sentences [Prawitz] |
| Full Idea: I agree entirely with Dummett that the right way to answer the question 'what is logic?' is to consider transitions between sentences. | |
| From: Dag Prawitz (Gentzen's Analysis of First-Order Proofs [1974], §04) | |
| A reaction: I always protest at this point that reliance on sentences is speciesism against animals, who are thereby debarred from reasoning. See the wonderful Idea 1875 of Chrysippus. Hacking's basic suggestion seems right. Transition between thoughts. |
| 9188 | Gödel proved that first-order logic is complete, and second-order logic incomplete [Gödel, by Dummett] |
| Full Idea: Gödel proved the completeness of standard formalizations of first-order logic, including Frege's original one. However, an implication of his famous theorem on the incompleteness of arithmetic is that second-order logic is incomplete. | |
| From: report of Kurt Gödel (works [1930]) by Michael Dummett - The Philosophy of Mathematics 3.1 | |
| A reaction: This must mean that it is impossible to characterise arithmetic fully in terms of first-order logic. In which case we can only characterize the features of abstract reality in general if we employ an incomplete system. We're doomed. |
| 13825 | Natural deduction introduction rules may represent 'definitions' of logical connectives [Prawitz] |
| Full Idea: With Gentzen's natural deduction, we may say that the introductions represent, as it were, the 'definitions' of the logical constants. The introductions are not literally understood as 'definitions'. | |
| From: Dag Prawitz (Gentzen's Analysis of First-Order Proofs [1974], 2.2.2) | |
| A reaction: [Hacking, in 'What is Logic? §9' says Gentzen had the idea that his rules actually define the constants; not sure if Prawitz and Hacking are disagreeing] |
| 13823 | In natural deduction, inferences are atomic steps involving just one logical constant [Prawitz] |
| Full Idea: In Gentzen's natural deduction, the inferences are broken down into atomic steps in such a way that each step involves only one logical constant. The steps are the introduction or elimination of the logical constants. | |
| From: Dag Prawitz (Gentzen's Analysis of First-Order Proofs [1974], 1.1) |
| 10620 | Originally truth was viewed with total suspicion, and only demonstrability was accepted [Gödel] |
| Full Idea: At that time (c.1930) a concept of objective mathematical truth as opposed to demonstrability was viewed with greatest suspicion and widely rejected as meaningless. | |
| From: Kurt Gödel (works [1930]), quoted by Peter Smith - Intro to Gödel's Theorems 28.2 | |
| A reaction: [quoted from a letter] This is the time of Ramsey's redundancy account, and before Tarski's famous paper of 1933. It is also the high point of Formalism, associated with Hilbert. |
| 17883 | Gödel's Theorems did not refute the claim that all good mathematical questions have answers [Gödel, by Koellner] |
| Full Idea: Gödel was quick to point out that his original incompleteness theorems did not produce instances of absolute undecidability and hence did not undermine Hilbert's conviction that for every precise mathematical question there is a discoverable answer. | |
| From: report of Kurt Gödel (works [1930]) by Peter Koellner - On the Question of Absolute Undecidability Intro | |
| A reaction: The normal simplistic view among philosophes is that Gödel did indeed decisively refute the optimistic claims of Hilbert. Roughly, whether Hilbert is right depends on which axioms of set theory you adopt. |
| 17885 | Gödel eventually hoped for a generalised completeness theorem leaving nothing undecidable [Gödel, by Koellner] |
| Full Idea: Eventually Gödel ...expressed the hope that there might be a generalised completeness theorem according to which there are no absolutely undecidable sentences. | |
| From: report of Kurt Gödel (works [1930]) by Peter Koellner - On the Question of Absolute Undecidability Intro | |
| A reaction: This comes as a bit of a shock to those who associate him with the inherent undecidability of reality. |
| 10614 | The real reason for Incompleteness in arithmetic is inability to define truth in a language [Gödel] |
| Full Idea: The concept of truth of sentences in a language cannot be defined in the language. This is the true reason for the existence of undecidable propositions in the formal systems containing arithmetic. | |
| From: Kurt Gödel (works [1930]), quoted by Peter Smith - Intro to Gödel's Theorems 21.6 | |
| A reaction: [from a letter by Gödel] So they key to Incompleteness is Tarski's observations about truth. Highly significant, as I take it. |
| 18431 | Internal relations combine some tropes into a nucleus, which bears the non-essential tropes [Simons, by Edwards] |
| Full Idea: Simons's 'nuclear' option blends features of the substratum and bundle theories. First we have tropes collected by virtue of their internal relations, forming the essential kernel or nucleus. This nucleus then bears the non-essential tropes. | |
| From: report of Peter Simons (Particulars in Particular Clothing [1994], p.567) by Douglas Edwards - Properties 3.5 | |
| A reaction: [compression of Edwards's summary] This strikes me as being a remarkably good theory. I am not sure of the ontological status of properties, such that they can (unaided) combine to make part of an object. What binds the non-essentials? |