18 ideas
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] |
10429 | It is best to say that a name designates iff there is something for it to designate [Sainsbury] |
10425 | Definite descriptions may not be referring expressions, since they can fail to refer [Sainsbury] |
10438 | Definite descriptions are usually rigid in subject, but not in predicate, position [Sainsbury] |
13843 | If it is a logic, the Löwenheim-Skolem theorem holds for it [Hacking] |
22668 | Apprehension is a complex intellect grasping the essence of a complex object [Holt,L] |
10432 | A new usage of a name could arise from a mistaken baptism of nothing [Sainsbury] |
10434 | Even a quantifier like 'someone' can be used referentially [Sainsbury] |
10431 | Things are thought to have a function, even when they can't perform them [Sainsbury] |