20 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] |
9390 | Logic guides thinking, but it isn't a substitute for it [Rumfitt] |
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] |
14249 | Boolos reinterprets second-order logic as plural logic [Boolos, by Oliver/Smiley] |
10830 | Second-order logic metatheory is set-theoretic, and second-order validity has set-theoretic problems [Boolos] |
10829 | A sentence can't be a truth of logic if it asserts the existence of certain sets [Boolos] |
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] |
10832 | '∀x x=x' only means 'everything is identical to itself' if the range of 'everything' is fixed [Boolos] |
13843 | If it is a logic, the Löwenheim-Skolem theorem holds for it [Hacking] |
10834 | Weak completeness: if it is valid, it is provable. Strong: it is provable from a set of sentences [Boolos] |
13841 | Why should compactness be definitive of logic? [Boolos, by Hacking] |
10833 | Many concepts can only be expressed by second-order logic [Boolos] |
9389 | Vague membership of sets is possible if the set is defined by its concept, not its members [Rumfitt] |