17 ideas
13838 | A decent modern definition should always imply a semantics [Hacking] |
13833 | 'Thinning' ('dilution') is the key difference between deduction (which allows it) and induction [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] |
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] |
12394 | If the result is bad, we change the rule; if we like the rule, we reject the result [Goodman] |
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] |
14292 | Dispositions seem more ethereal than behaviour; a non-occult account of them would be nice [Goodman] |
18749 | Goodman argued that the confirmation relation can never be formalised [Goodman, by Horsten/Pettigrew] |
17646 | Goodman showed that every sound inductive argument has an unsound one of the same form [Goodman, by Putnam] |
7495 | Apart from the fear, dying is an easy duty [Montaigne] |
4794 | We don't use laws to make predictions, we call things laws if we make predictions with them [Goodman] |