39 ideas
5042 | For every event it is possible for an omniscient being to give a reason for its occurrence [Leibniz] |
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] |
9672 | Free logic is one of the few first-order non-classical logics [Priest,G] |
9697 | X1 x X2 x X3... x Xn indicates the 'cartesian product' of those sets [Priest,G] |
9685 | <a,b&62; is a set whose members occur in the order shown [Priest,G] |
9674 | {x; A(x)} is a set of objects satisfying the condition A(x) [Priest,G] |
9673 | {a1, a2, ...an} indicates that a set comprising just those objects [Priest,G] |
9675 | a ∈ X says a is an object in set X; a ∉ X says a is not in X [Priest,G] |
9677 | Φ indicates the empty set, which has no members [Priest,G] |
9676 | {a} is the 'singleton' set of a (not the object a itself) [Priest,G] |
9678 | X⊆Y means set X is a 'subset' of set Y [Priest,G] |
9679 | X⊂Y means set X is a 'proper subset' of set Y [Priest,G] |
9681 | X = Y means the set X equals the set Y [Priest,G] |
9683 | X ∩ Y indicates the 'intersection' of sets X and Y, the objects which are in both sets [Priest,G] |
9684 | Y - X is the 'relative complement' of X with respect to Y; the things in Y that are not in X [Priest,G] |
9682 | X∪Y indicates the 'union' of all the things in sets X and Y [Priest,G] |
9692 | The 'union' of two sets is a set containing all the things in either of the sets [Priest,G] |
9693 | The 'intersection' of two sets is a set of the things that are in both sets [Priest,G] |
9694 | The 'relative complement' is things in the second set not in the first [Priest,G] |
9698 | The 'induction clause' says complex formulas retain the properties of their basic formulas [Priest,G] |
9696 | A 'cartesian product' of sets is the set of all the n-tuples with one member in each of the sets [Priest,G] |
9686 | A 'set' is a collection of objects [Priest,G] |
9687 | A 'member' of a set is one of the objects in the set [Priest,G] |
9695 | An 'ordered pair' (or ordered n-tuple) is a set with its members in a particular order [Priest,G] |
9688 | A 'singleton' is a set with only one member [Priest,G] |
9689 | The 'empty set' or 'null set' has no members [Priest,G] |
9690 | A set is a 'subset' of another set if all of its members are in that set [Priest,G] |
9691 | A 'proper subset' is smaller than the containing set [Priest,G] |
9680 | The empty set Φ is a subset of every set (including itself) [Priest,G] |
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] |