23 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) |
| 10301 | The axiom of choice is controversial, but it could be replaced [Shapiro] |
| Full Idea: The axiom of choice has a troubled history, but is now standard in mathematics. It could be replaced with a principle of comprehension for functions), or one could omit the variables ranging over functions. | |
| From: Stewart Shapiro (Higher-Order Logic [2001], n 3) |
| 10588 | First-order logic is Complete, and Compact, with the Löwenheim-Skolem Theorems [Shapiro] |
| Full Idea: Early study of first-order logic revealed a number of important features. Gödel showed that there is a complete, sound and effective deductive system. It follows that it is Compact, and there are also the downward and upward Löwenheim-Skolem Theorems. | |
| From: Stewart Shapiro (Higher-Order Logic [2001], 2.1) |
| 10298 | Some say that second-order logic is mathematics, not logic [Shapiro] |
| Full Idea: Some authors argue that second-order logic (with standard semantics) is not logic at all, but is a rather obscure form of mathematics. | |
| From: Stewart Shapiro (Higher-Order Logic [2001], 2.4) |
| 10299 | If the aim of logic is to codify inferences, second-order logic is useless [Shapiro] |
| Full Idea: If the goal of logical study is to present a canon of inference, a calculus which codifies correct inference patterns, then second-order logic is a non-starter. | |
| From: Stewart Shapiro (Higher-Order Logic [2001], 2.4) | |
| A reaction: This seems to be because it is not 'complete'. However, moves like plural quantification seem aimed at capturing ordinary language inferences, so the difficulty is only that there isn't a precise 'calculus'. |
| 10300 | Logical consequence can be defined in terms of the logical terminology [Shapiro] |
| Full Idea: Informally, logical consequence is sometimes defined in terms of the meanings of a certain collection of terms, the so-called 'logical terminology'. | |
| From: Stewart Shapiro (Higher-Order Logic [2001], 2.4) | |
| A reaction: This seems to be a compositional account, where we build a full account from an account of the atomic bits, perhaps presented as truth-tables. |
| 10290 | Second-order variables also range over properties, sets, relations or functions [Shapiro] |
| Full Idea: Second-order variables can range over properties, sets, or relations on the items in the domain-of-discourse, or over functions from the domain itself. | |
| From: Stewart Shapiro (Higher-Order Logic [2001], 2.1) |
| 10590 | Up Löwenheim-Skolem: if natural numbers satisfy wffs, then an infinite domain satisfies them [Shapiro] |
| Full Idea: Upward Löwenheim-Skolem: if a set of first-order formulas is satisfied by a domain of at least the natural numbers, then it is satisfied by a model of at least some infinite cardinal. | |
| From: Stewart Shapiro (Higher-Order Logic [2001], 2.1) |
| 10296 | The Löwenheim-Skolem Theorems fail for second-order languages with standard semantics [Shapiro] |
| Full Idea: Both of the Löwenheim-Skolem Theorems fail for second-order languages with a standard semantics | |
| From: Stewart Shapiro (Higher-Order Logic [2001], 2.3.2) |
| 10297 | The Löwenheim-Skolem theorem seems to be a defect of first-order logic [Shapiro] |
| Full Idea: The Löwenheim-Skolem theorem is usually taken as a sort of defect (often thought to be inevitable) of the first-order logic. | |
| From: Stewart Shapiro (Higher-Order Logic [2001], 2.4) | |
| A reaction: [He is quoting Wang 1974 p.154] |
| 10292 | Downward Löwenheim-Skolem: if there's an infinite model, there is a countable model [Shapiro] |
| Full Idea: Downward Löwenheim-Skolem: a finite or denumerable set of first-order formulas that is satisfied by a model whose domain is infinite is satisfied in a model whose domain is the natural numbers | |
| From: Stewart Shapiro (Higher-Order Logic [2001], 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. |
| 10294 | Second-order logic has the expressive power for mathematics, but an unworkable model theory [Shapiro] |
| Full Idea: Full second-order logic has all the expressive power needed to do mathematics, but has an unworkable model theory. | |
| From: Stewart Shapiro (Higher-Order Logic [2001], 2.1) | |
| A reaction: [he credits Cowles for this remark] Having an unworkable model theory sounds pretty serious to me, as I'm not inclined to be interested in languages which don't produce models of some sort. Surely models are the whole point? |
| 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) |
| 10591 | Logicians use 'property' and 'set' interchangeably, with little hanging on it [Shapiro] |
| Full Idea: In studying second-order logic one can think of relations and functions as extensional or intensional, or one can leave it open. Little turns on this here, and so words like 'property', 'class', and 'set' are used interchangeably. | |
| From: Stewart Shapiro (Higher-Order Logic [2001], 2.2.1) | |
| A reaction: Important. Students of the metaphysics of properties, who arrive with limited experience of logic, are bewildered by this attitude. Note that the metaphysics is left wide open, so never let logicians hijack the metaphysical problem of properties. |
| 15473 | How does anything get outside itself? [Fodor, by Martin,CB] |
| Full Idea: Fodor asks the stirring and basic question 'How does anything get outside itself?' | |
| From: report of Jerry A. Fodor (works [1986]) by C.B. Martin - The Mind in Nature 03.6 | |
| A reaction: Is this one of those misconceived questions, like major issues concerning 'what's it like to be?' In what sense am I outside myself? Is a mind any more mysterious than a shadow? |
| 2981 | Is intentionality outwardly folk psychology, inwardly mentalese? [Lyons on Fodor] |
| Full Idea: For Fodor the intentionality of the propositional-attitude vocabulary of our folk psychology is the outward expression of the inward intentionality of the language of the brain. | |
| From: comment on Jerry A. Fodor (works [1986]) by William Lyons - Approaches to Intentionality p.39 | |
| A reaction: I would be very cautious about this. Folk psychology works, so it must have a genuine basis in how brains work, but it breaks down in unusual situations, and might even be a total (successful) fiction. |
| 2985 | Are beliefs brains states, but picked out at a "higher level"? [Lyons on Fodor] |
| Full Idea: Fodor holds that beliefs are brain states or processes, but picked out at a 'higher' or 'special science' level. | |
| From: comment on Jerry A. Fodor (works [1986]) by William Lyons - Approaches to Intentionality p.82 | |
| A reaction: I don't think you can argue with this. Levels of physical description exist (e.g. pure physics tells you nothing about the weather), and I think 'process' is the best word for the mind (Idea 4931). |
| 3135 | Is thought a syntactic computation using representations? [Fodor, by Rey] |
| Full Idea: The modest mentalism of the Computational/Representational Theory of Thought (CRTT), associated with Fodor, says mental processes are computational, defined over syntactically specified entities, and these entities represent the world (are also semantic). | |
| From: report of Jerry A. Fodor (works [1986]) by Georges Rey - Contemporary Philosophy of Mind Int.3 | |
| A reaction: This seems to imply that if you built a machine that did all these things, it would become conscious, which sounds unlikely. Do footprints 'represent' feet, or does representation need prior consciousness? |
| 2983 | Maybe narrow content is physical, broad content less so [Lyons on Fodor] |
| Full Idea: Fodor is concerned with producing a realist and physicalist account of 'narrow content' (i.e. wholly in-the-head content). | |
| From: comment on Jerry A. Fodor (works [1986]) by William Lyons - Approaches to Intentionality p.54 | |
| A reaction: The emergence of 'wide' content has rather shaken Fodor's game plan. We can say "Oh dear, I thought I was referring to H2O", so there must be at least some narrow aspect to reference. |