9 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. |
| 18812 | Split out the logical vocabulary, make an assignment to the rest. It's logical if premises and conclusion match [Tarski, by Rumfitt] |
| Full Idea: Tarski made a division of logical and non-logical vocabulary. He then defined a model as a non-logical assignment satisfying the corresponding sentential function. Then a conclusion follows logically if every model of the premises models the conclusion. | |
| From: report of Alfred Tarski (The Concept of Logical Consequence [1936]) by Ian Rumfitt - The Boundary Stones of Thought 3.2 | |
| A reaction: [compressed] This is Tarski's account of logical consequence, which follows on from his account of truth. 'Logical validity' is then 'true in every model'. Rumfitt doubts whether Tarski has given the meaning of 'logical consequence'. |
| 13344 | X follows from sentences K iff every model of K also models X [Tarski] |
| Full Idea: The sentence X follows logically from the sentences of the class K if and only if every model of the class K is also a model of the sentence X. | |
| From: Alfred Tarski (The Concept of Logical Consequence [1936], p.417) | |
| A reaction: [see Idea 13343 for his account of a 'model'] He is offering to define logical consequence in general, but this definition fits what we now call 'semantic consequence', written |=. This it is standard practice to read |= as 'models'. |
| 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. |
| 13343 | A 'model' is a sequence of objects which satisfies a complete set of sentential functions [Tarski] |
| Full Idea: An arbitrary sequence of objects which satisfies every sentential function of the sentences L' will be called a 'model' or realization of the class L of sentences. There can also be a model of a single sentence is this way. | |
| From: Alfred Tarski (The Concept of Logical Consequence [1936], p.417) | |
| A reaction: [L' is L with the constants replaced by variables] Tarski is the originator of model theory, which is central to modern logic. The word 'realization' is a helpful indicator of what he has in mind. A model begins to look like a possible world. |
| 17060 | Best Explanation is the core notion of epistemology [Harman, by Smart] |
| Full Idea: Gilbert Harman introduced the term 'inference to the best explanation', and argued that it is the core notion of epistemology. | |
| From: report of Gilbert Harman (The Inference to the Best Explanation [1974]) by J.J.C. Smart - Explanation - Opening Address p. 01 | |
| A reaction: Hard to assess that, but it sounds right. I'm a fan of coherence theories of justification, and also coherence theories of explanation, and there is a neat package there somewhere. |
| 13345 | Sentences are 'analytical' if every sequence of objects models them [Tarski] |
| Full Idea: A class of sentences can be called 'analytical' if every sequence of objects is a model of it. | |
| From: Alfred Tarski (The Concept of Logical Consequence [1936], p.418) | |
| A reaction: See Idea 13344 and Idea 13343 for the context of this assertion. |
| 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). |