11 ideas
| 7791 | The simplest of the logics based on possible worlds is Lewis's S5 [Lewis,CI, by Girle] |
| Full Idea: C.I.Lewis constructed five axiomatic systems of modal logic, and named them S1 to S5. It turns out that the simplest of the logics based on possible worlds is the same as Lewis's S5. | |
| From: report of C.I. Lewis (works [1935]) by Rod Girle - Modal Logics and Philosophy 2.1 | |
| A reaction: Nathan Salmon ('Reference and Essence' 2nd ed) claims (on p.xvii) that "the correct modal logic is weaker than S5 and weaker even than S4". Which is the greater virtue, simplicity or weakness? |
| 11022 | Gentzen introduced a natural deduction calculus (NK) in 1934 [Gentzen, by Read] |
| Full Idea: Gentzen introduced a natural deduction calculus (NK) in 1934. | |
| From: report of Gerhard Gentzen (works [1938]) by Stephen Read - Thinking About Logic Ch.8 |
| 23476 | Logical constants seem to be entities in propositions, but are actually pure form [Russell] |
| Full Idea: 'Logical constants', which might seem to be entities occurring in logical propositions, are really concerned with pure form, and are not actually constituents of the propositions in the verbal expressions of which their names occur. | |
| From: Bertrand Russell (The Theory of Knowledge [1913], 1.IX) | |
| A reaction: This seems to entirely deny the existence of logical constants, and yet he says that they are named. Russell was obviously under pressure here from Wittgenstein. |
| 23477 | We use logical notions, so they must be objects - but I don't know what they really are [Russell] |
| Full Idea: Such words as or, not, all, some, plainly involve logical notions; since we use these intelligently, we must be acquainted with the logical objects involved. But their isolation is difficult, and I do not know what the logical objects really are. | |
| From: Bertrand Russell (The Theory of Knowledge [1913], 1.IX) | |
| A reaction: See Idea 23476, from the previous page. Russell is struggling. Wittgenstein was telling him that the constants are rules (shown in truth tables), rather than objects. |
| 11065 | The inferential role of a logical constant constitutes its meaning [Gentzen, by Hanna] |
| Full Idea: Gentzen argued that the inferential role of a logical constant constitutes its meaning. | |
| From: report of Gerhard Gentzen (works [1938]) by Robert Hanna - Rationality and Logic 5.3 | |
| A reaction: Possibly inspired by Wittgenstein's theory of meaning as use? This idea was the target of Prior's famous connective 'tonk', which has the role of implying anything you like, proving sentences which are not logical consequences. |
| 11023 | The logical connectives are 'defined' by their introduction rules [Gentzen] |
| Full Idea: The introduction rules represent, as it were, the 'definitions' of the symbols concerned, and the elimination rules are no more, in the final analysis, than the consequences of these definitions. | |
| From: Gerhard Gentzen (works [1938]), quoted by Stephen Read - Thinking About Logic Ch.8 | |
| A reaction: If an introduction-rule (or a truth table) were taken as fixed and beyond dispute, then it would have the status of a definition, since there would be nothing else to appeal to. So is there anything else to appeal to here? |
| 11213 | Each logical symbol has an 'introduction' rule to define it, and hence an 'elimination' rule [Gentzen] |
| Full Idea: To every logical symbol there belongs precisely one inference figure which 'introduces' the symbol ..and one which 'eliminates' it. The introductions represent the 'definitions' of the symbols concerned, and eliminations are consequences of these. | |
| From: Gerhard Gentzen (works [1938], II.5.13), quoted by Ian Rumfitt - "Yes" and "No" III | |
| A reaction: [1935 paper] This passage is famous, in laying down the basics of natural deduction systems of logic (ones using only rules, and avoiding axioms). Rumfitt questions whether Gentzen's account gives the sense of the connectives. |
| 18273 | Logical truths are known by their extreme generality [Russell] |
| Full Idea: A touchstone by which logical propositions may be distinguished from all others is that they result from a process of generalisation which has been carried to its utmost limits. | |
| From: Bertrand Russell (The Theory of Knowledge [1913], p.129), quoted by J. Alberto Coffa - The Semantic Tradition from Kant to Carnap 7 'What' |
| 10067 | Gentzen proved the consistency of arithmetic from assumptions beyond arithmetic [Gentzen, by Musgrave] |
| Full Idea: Gentzen proved the consistency of arithmetic from assumptions which transcend arithmetic. | |
| From: report of Gerhard Gentzen (works [1938]) by Alan Musgrave - Logicism Revisited §5 | |
| A reaction: This does not contradict Gödel's famous result, but reinforces it. The interesting question is what assumptions Gentzen felt he had to make. |
| 22315 | There can't be a negative of a complex, which is negated by its non-existence [Potter on Russell] |
| Full Idea: On Russell's pre-war conception it is obvious that a complex cannot be negative. If a complex were true, what would make it false would be its non-existence, not the existence of some other complex. | |
| From: comment on Bertrand Russell (The Theory of Knowledge [1913]) by Michael Potter - The Rise of Analytic Philosophy 1879-1930 41 'Neg' | |
| A reaction: It might be false because it doesn't exist, but also 'made' false by a rival complex (such as Desdemona loving Othello). |
| 11002 | Equating necessity with informal provability is the S4 conception of necessity [Lewis,CI, by Read] |
| Full Idea: C.I.Lewis's S4 system develops a sense of necessity as 'provability' in some fairly informal sense. | |
| From: report of C.I. Lewis (works [1935]) by Stephen Read - Thinking About Logic Ch. 4 |