9 ideas
| 8188 | Davidson takes truth to attach to individual sentences [Davidson, by Dummett] |
| Full Idea: Davidson, by contrast to Frege, has taken truth as attaching to linguistic items, that is, to actual or hypothetical token sentences. | |
| From: report of Donald Davidson (True to the Facts [1969]) by Michael Dummett - Truth and the Past 1 | |
| A reaction: My personal notion of truth is potentially applicable to animals, so this doesn't appeal to me. I am happy to think of animals as believing simple propositions that never get as far as language, and being right or wrong about them. |
| 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) |
| 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) |
| 10558 | Abstract objects are actually constituted by the properties by which we conceive them [Zalta] |
| Full Idea: Where for ordinary objects one can discover the properties they exemplify, abstract objects are actually constituted or determined by the properties by which we conceive them. I use the technical term 'x encodes F' for this idea. | |
| From: Edward N. Zalta (Deriving Kripkean Claims with Abstract Objects [2006], 2 n2) | |
| A reaction: One might say that whereas concrete objects can be dubbed (in the Kripke manner), abstract objects can only be referred to by descriptions. See 10557 for more technicalities about Zalta's idea. |
| 10557 | Abstract objects are captured by second-order modal logic, plus 'encoding' formulas [Zalta] |
| Full Idea: My object theory is formulated in a 'syntactically second-order' modal predicate calculus modified only so as to admit a second kind of atomic formula ('xF'), which asserts that object x 'encodes' property F. | |
| From: Edward N. Zalta (Deriving Kripkean Claims with Abstract Objects [2006], p.2) | |
| A reaction: This is summarising Zalta's 1983 theory of abstract objects. See Idea 10558 for Zalta's idea in plain English. |