42 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] |
| 10147 | The Axiom of Choice is consistent with the other axioms of set theory [Feferman/Feferman] |
| 10148 | Axiom of Choice: a set exists which chooses just one element each of any set of sets [Feferman/Feferman] |
| 10149 | Platonist will accept the Axiom of Choice, but others want criteria of selection or definition [Feferman/Feferman] |
| 10150 | The Trichotomy Principle is equivalent to the Axiom of Choice [Feferman/Feferman] |
| 10146 | Cantor's theories needed the Axiom of Choice, but it has led to great controversy [Feferman/Feferman] |
| 10158 | A structure is a 'model' when the axioms are true. So which of the structures are models? [Feferman/Feferman] |
| 10162 | Tarski and Vaught established the equivalence relations between first-order structures [Feferman/Feferman] |
| 10160 | Löwenheim-Skolem says if the sentences are countable, so is the model [Feferman/Feferman] |
| 10159 | Löwenheim-Skolem Theorem, and Gödel's completeness of first-order logic, the earliest model theory [Feferman/Feferman] |
| 10161 | If a sentence holds in every model of a theory, then it is logically derivable from the theory [Feferman/Feferman] |
| 10156 | 'Recursion theory' concerns what can be solved by computing machines [Feferman/Feferman] |
| 10155 | Both Principia Mathematica and Peano Arithmetic are undecidable [Feferman/Feferman] |
| 19400 | Possibles demand existence, so as many of them as possible must actually exist [Leibniz] |
| 19401 | God's sufficient reason for choosing reality is in the fitness or perfection of possibilities [Leibniz] |
| 19402 | The actual universe is the richest composite of what is possible [Leibniz] |