12 ideas
| 17884 | Mathematical set theory has many plausible stopping points, such as finitism, and predicativism [Koellner] |
| Full Idea: There are many coherent stopping points in the hierarchy of increasingly strong mathematical systems, starting with strict finitism, and moving up through predicativism to the higher reaches of set theory. | |
| From: Peter Koellner (On the Question of Absolute Undecidability [2006], Intro) |
| 17893 | 'Reflection principles' say the whole truth about sets can't be captured [Koellner] |
| Full Idea: Roughly speaking, 'reflection principles' assert that anything true in V [the set hierarchy] falls short of characterising V in that it is true within some earlier level. | |
| From: Peter Koellner (On the Question of Absolute Undecidability [2006], 2.1) |
| 11022 | Gentzen introduced a natural deduction calculus (NK) in 1934 [Gentzen, by Read] |
| Full Idea: Gentzen introduced a natural deduction calculus (NK) in 1934. | |
| From: report of Gerhard Gentzen (works [1938]) by Stephen Read - Thinking About Logic Ch.8 |
| 11065 | The inferential role of a logical constant constitutes its meaning [Gentzen, by Hanna] |
| Full Idea: Gentzen argued that the inferential role of a logical constant constitutes its meaning. | |
| From: report of Gerhard Gentzen (works [1938]) by Robert Hanna - Rationality and Logic 5.3 | |
| A reaction: Possibly inspired by Wittgenstein's theory of meaning as use? This idea was the target of Prior's famous connective 'tonk', which has the role of implying anything you like, proving sentences which are not logical consequences. |
| 11023 | The logical connectives are 'defined' by their introduction rules [Gentzen] |
| Full Idea: The introduction rules represent, as it were, the 'definitions' of the symbols concerned, and the elimination rules are no more, in the final analysis, than the consequences of these definitions. | |
| From: Gerhard Gentzen (works [1938]), quoted by Stephen Read - Thinking About Logic Ch.8 | |
| A reaction: If an introduction-rule (or a truth table) were taken as fixed and beyond dispute, then it would have the status of a definition, since there would be nothing else to appeal to. So is there anything else to appeal to here? |
| 11213 | Each logical symbol has an 'introduction' rule to define it, and hence an 'elimination' rule [Gentzen] |
| Full Idea: To every logical symbol there belongs precisely one inference figure which 'introduces' the symbol ..and one which 'eliminates' it. The introductions represent the 'definitions' of the symbols concerned, and eliminations are consequences of these. | |
| From: Gerhard Gentzen (works [1938], II.5.13), quoted by Ian Rumfitt - "Yes" and "No" III | |
| A reaction: [1935 paper] This passage is famous, in laying down the basics of natural deduction systems of logic (ones using only rules, and avoiding axioms). Rumfitt questions whether Gentzen's account gives the sense of the connectives. |
| 17894 | We have no argument to show a statement is absolutely undecidable [Koellner] |
| Full Idea: There is at present no solid argument to the effect that a given statement is absolutely undecidable. | |
| From: Peter Koellner (On the Question of Absolute Undecidability [2006], 5.3) |
| 17890 | There are at least eleven types of large cardinal, of increasing logical strength [Koellner] |
| Full Idea: Some of the standard large cardinals (in order of increasing (logical) strength) are: inaccessible, Mahlo, weakly compact, indescribable, Erdös, measurable, strong, Wodin, supercompact, huge etc. (...and ineffable). | |
| From: Peter Koellner (On the Question of Absolute Undecidability [2006], 1.4) | |
| A reaction: [I don't understand how cardinals can have 'logical strength', but I pass it on anyway] |
| 17887 | PA is consistent as far as we can accept, and we expand axioms to overcome limitations [Koellner] |
| Full Idea: To the extent that we are justified in accepting Peano Arithmetic we are justified in accepting its consistency, and so we know how to expand the axiom system so as to overcome the limitation [of Gödel's Second Theorem]. | |
| From: Peter Koellner (On the Question of Absolute Undecidability [2006], 1.1) | |
| A reaction: Each expansion brings a limitation, but then you can expand again. |
| 17891 | Arithmetical undecidability is always settled at the next stage up [Koellner] |
| Full Idea: The arithmetical instances of undecidability that arise at one stage of the hierarchy are settled at the next. | |
| From: Peter Koellner (On the Question of Absolute Undecidability [2006], 1.4) |
| 10067 | Gentzen proved the consistency of arithmetic from assumptions beyond arithmetic [Gentzen, by Musgrave] |
| Full Idea: Gentzen proved the consistency of arithmetic from assumptions which transcend arithmetic. | |
| From: report of Gerhard Gentzen (works [1938]) by Alan Musgrave - Logicism Revisited §5 | |
| A reaction: This does not contradict Gödel's famous result, but reinforces it. The interesting question is what assumptions Gentzen felt he had to make. |
| 16755 | The possible Aristotelian view that forms are real and active principles is clearly wrong [Fine,K, by Pasnau] |
| Full Idea: Aristotle seems to have a possible basis for the belief [in individual forms], namely that forms are real and active principles in the world, which is denied by any right-minded modern. | |
| From: report of Kit Fine (A Puzzle Concerning Matter and Form [1994], p.19) by Robert Pasnau - Metaphysical Themes 1274-1671 24.3 n8 | |
| A reaction: Pasnau says this is the view of forms promoted by the scholastics, whereas Aristotle's own view should be understood as 'metaphysical'. |