38 ideas
| 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] |
| 9675 | a ∈ X says a is an object in set X; a ∉ X says a is not in X [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] |
| 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] |
| 9679 | X⊂Y means set X is a 'proper subset' of set Y [Priest,G] |
| 9678 | X⊆Y means set X is a '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] |
| 9682 | X∪Y indicates the 'union' of all the things in sets X and Y [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] |
| 9694 | The 'relative complement' is things in the second set not in the first [Priest,G] |
| 9693 | The 'intersection' of two sets is a set of the things that are in both sets [Priest,G] |
| 9692 | The 'union' of two sets is a set containing all the things in either of the sets [Priest,G] |
| 9698 | The 'induction clause' says complex formulas retain the properties of their basic formulas [Priest,G] |
| 9688 | A 'singleton' is a set with only one member [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] |
| 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] |
| 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] |
| 13010 | In order to select the logic justified by experience, we would need to use a lot of logic [Boghossian on Quine] |
| 9002 | Elementary logic requires truth-functions, quantifiers (and variables), identity, and also sets of variables [Quine] |
| 13681 | Logical consequence is marked by being preserved under all nonlogical substitutions [Quine, by Sider] |
| 13829 | If logical truths essentially depend on logical constants, we had better define the latter [Hacking on Quine] |
| 9003 | Set theory was struggling with higher infinities, when new paradoxes made it baffling [Quine] |
| 9004 | If set theory is not actually a branch of logic, then Frege's derivation of arithmetic would not be from logic [Quine] |
| 9006 | Commitment to universals is as arbitrary or pragmatic as the adoption of a new system of bookkeeping [Quine] |
| 9001 | Frege moved Kant's question about a priori synthetic to 'how is logical certainty possible?' [Quine] |
| 9005 | Examination of convention in the a priori begins to blur the distinction with empirical knowledge [Quine] |
| 1748 | Archelaus was the first person to say that the universe is boundless [Archelaus, by Diog. Laertius] |
| 5989 | Archelaus said life began in a primeval slime [Archelaus, by Schofield] |