6 ideas
| 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. |
| 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. |
| 19699 | A Gettier case is a belief which is true, and its fallible justification involves some luck [Hetherington] |
| Full Idea: A Gettier case contains a belief which is true and well justified without being knowledge. Its justificatory support is also fallible, ...and there is considerable luck in how the belief combnes being true with being justified. | |
| From: Stephen Hetherington (The Gettier Problem [2011], 5) | |
| A reaction: This makes luck the key factor. 'Luck' is a rather vague concept, and so the sort of luck involved must first be spelled out. Or the varieties of luck that can produce this outcome. |
| 3178 | A fast machine could pass all behavioural tests with a vast lookup table [Block, by Rey] |
| Full Idea: Ned Block proposes a machine (a 'blockhead') which could pass the Turing Test just by looking up responses in a vast look-up table. | |
| From: report of Ned Block (works [1984]) by Georges Rey - Contemporary Philosophy of Mind 5.3 | |
| A reaction: Once you suspected you were talking to a blockhead, I think you could catch it out in a Turing Test. How can the lookup table keep up to date with immediate experience? Ask it about your new poem. |
| 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). |