19 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] |
14187 | If logic is topic-neutral that means it delves into all subjects, rather than having a pure subject matter [Read] |
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] |
14188 | Not all arguments are valid because of form; validity is just true premises and false conclusion being impossible [Read] |
14182 | If the logic of 'taller of' rests just on meaning, then logic may be the study of merely formal consequence [Read] |
14183 | Maybe arguments are only valid when suppressed premises are all stated - but why? [Read] |
14184 | In modus ponens the 'if-then' premise contributes nothing if the conclusion follows anyway [Read] |
13837 | With a pure notion of truth and consequence, the meanings of connectives are fixed syntactically [Hacking] |
14186 | Logical connectives contain no information, but just record combination relations between facts [Read] |
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] |
6019 | If someone squashed a horse to make a dog, something new would now exist [Mnesarchus] |
14185 | Conditionals are just a shorthand for some proof, leaving out the details [Read] |