25 ideas
10688 | 'Equivocation' is when terms do not mean the same thing in premises and conclusion [Beall/Restall] |
10775 | The axiom of choice now seems acceptable and obvious (if it is meaningful) [Tharp] |
10766 | Logic is either for demonstration, or for characterizing structures [Tharp] |
10690 | Formal logic is invariant under permutations, or devoid of content, or gives the norms for thought [Beall/Restall] |
10767 | Elementary logic is complete, but cannot capture mathematics [Tharp] |
10769 | Second-order logic isn't provable, but will express set-theory and classic problems [Tharp] |
10691 | Logical consequence needs either proofs, or absence of counterexamples [Beall/Restall] |
10695 | Logical consequence is either necessary truth preservation, or preservation based on interpretation [Beall/Restall] |
10689 | A step is a 'material consequence' if we need contents as well as form [Beall/Restall] |
10762 | In sentential logic there is a simple proof that all truth functions can be reduced to 'not' and 'and' [Tharp] |
10776 | The main quantifiers extend 'and' and 'or' to infinite domains [Tharp] |
10774 | There are at least five unorthodox quantifiers that could be used [Tharp] |
10696 | A 'logical truth' (or 'tautology', or 'theorem') follows from empty premises [Beall/Restall] |
10693 | Models are mathematical structures which interpret the non-logical primitives [Beall/Restall] |
10777 | Skolem mistakenly inferred that Cantor's conceptions were illusory [Tharp] |
10773 | The Löwenheim-Skolem property is a limitation (e.g. can't say there are uncountably many reals) [Tharp] |
10765 | Soundness would seem to be an essential requirement of a proof procedure [Tharp] |
10763 | Completeness and compactness together give axiomatizability [Tharp] |
10770 | If completeness fails there is no algorithm to list the valid formulas [Tharp] |
10771 | Compactness is important for major theories which have infinitely many axioms [Tharp] |
10772 | Compactness blocks infinite expansion, and admits non-standard models [Tharp] |
10764 | A complete logic has an effective enumeration of the valid formulas [Tharp] |
10768 | Effective enumeration might be proved but not specified, so it won't guarantee knowledge [Tharp] |
10692 | Hilbert proofs have simple rules and complex axioms, and natural deduction is the opposite [Beall/Restall] |
16570 | Elements are found last in dismantling bodies, and first in generating them [Albert of Saxony] |