16 ideas
| 6405 | Moore's 'The Nature of Judgement' (1898) marked the rejection (with Russell) of idealism [Moore,GE, by Grayling] |
| 7527 | Analysis for Moore and Russell is carving up the world, not investigating language [Moore,GE, by Monk] |
| 13838 | A decent modern definition should always imply a semantics [Hacking] |
| 13834 | Gentzen's Cut Rule (or transitivity of deduction) is 'If A |- B and B |- C, then A |- C' [Hacking] |
| 13835 | Only Cut reduces complexity, so logic is constructive without it, and it can be dispensed with [Hacking] |
| 13833 | 'Thinning' ('dilution') is the key difference between deduction (which allows it) and induction [Hacking] |
| 13845 | The various logics are abstractions made from terms like 'if...then' in English [Hacking] |
| 13840 | First-order logic is the strongest complete compact theory with Löwenheim-Skolem [Hacking] |
| 13844 | A limitation of first-order logic is that it cannot handle branching quantifiers [Hacking] |
| 13842 | Second-order completeness seems to need intensional entities and possible worlds [Hacking] |
| 13837 | With a pure notion of truth and consequence, the meanings of connectives are fixed syntactically [Hacking] |
| 13839 | Perhaps variables could be dispensed with, by arrows joining places in the scope of quantifiers [Hacking] |
| 13843 | If it is a logic, the Löwenheim-Skolem theorem holds for it [Hacking] |
| 22302 | Moor bypassed problems of correspondence by saying true propositions ARE facts [Moore,GE, by Potter] |
| 7526 | Hegelians say propositions defy analysis, but Moore says they can be broken down [Moore,GE, by Monk] |
| 19376 | A machine is best defined by its final cause, which explains the roles of the parts [Leibniz] |