17 ideas
| 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) |
| 11211 | If a sound conclusion comes from two errors that cancel out, the path of the argument must matter [Rumfitt] |
| Full Idea: If a designated conclusion follows from the premisses, but the argument involves two howlers which cancel each other out, then the moral is that the path an argument takes from premisses to conclusion does matter to its logical evaluation. | |
| From: Ian Rumfitt ("Yes" and "No" [2000], II) | |
| A reaction: The drift of this is that our view of logic should be a little closer to the reasoning of ordinary language, and we should rely a little less on purely formal accounts. |
| 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. |
| 11210 | Standardly 'and' and 'but' are held to have the same sense by having the same truth table [Rumfitt] |
| Full Idea: If 'and' and 'but' really are alike in sense, in what might that likeness consist? Some philosophers of classical logic will reply that they share a sense by virtue of sharing a truth table. | |
| From: Ian Rumfitt ("Yes" and "No" [2000]) | |
| A reaction: This is the standard view which Rumfitt sets out to challenge. |
| 11212 | The sense of a connective comes from primitively obvious rules of inference [Rumfitt] |
| Full Idea: A connective will possess the sense that it has by virtue of its competent users' finding certain rules of inference involving it to be primitively obvious. | |
| From: Ian Rumfitt ("Yes" and "No" [2000], III) | |
| A reaction: Rumfitt cites Peacocke as endorsing this view, which characterises the logical connectives by their rules of usage rather than by their pure semantic value. |
| 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) |
| 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? |
| 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. |
| 12708 | The soul is not a substance but a substantial form, the first active faculty [Leibniz] |
| Full Idea: The soul, properly and accurately speaking, is not a substance, but a substantial form, or the primitive form existing in substances, the first act, the first active faculty. | |
| From: Gottfried Leibniz (Letters to Fardella [1690], A6.4.1670), quoted by Daniel Garber - Leibniz:Body,Substance,Monad 2 | |
| A reaction: In all of Leibniz's many gropings towards what is at the heart of a unified object, I pounce on the phrase "the first active faculty" as the one that suits me. I take that to be a 'power'. It has two characteristics - it is active, and it is basic. |
| 11214 | We learn 'not' along with affirmation, by learning to either affirm or deny a sentence [Rumfitt] |
| Full Idea: The standard view is that affirming not-A is more complex than affirming the atomic sentence A itself, with the latter determining its sense. But we could learn 'not' directly, by learning at once how to either affirm A or reject A. | |
| From: Ian Rumfitt ("Yes" and "No" [2000], IV) | |
| A reaction: [compressed] This seems fairly anti-Fregean in spirit, because it looks at the psychology of how we learn 'not' as a way of clarifying what we mean by it, rather than just looking at its logical behaviour (and thus giving it a secondary role). |