18 ideas
6950 | You can be rational with undetected or minor inconsistencies [Harman] |
6954 | A coherent conceptual scheme contains best explanations of most of your beliefs [Harman] |
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] |
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] |
16706 | Generation is when local motions aggregate to become a single subject [Nicholas of Autrecourt] |
6955 | Enumerative induction is inference to the best explanation [Harman] |
6952 | Induction is 'defeasible', since additional information can invalidate it [Harman] |
6953 | All reasoning is inductive, and deduction only concerns implication [Harman] |
6951 | Ordinary rationality is conservative, starting from where your beliefs currently are [Harman] |