41 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] |
| 10301 | The axiom of choice is controversial, but it could be replaced [Shapiro] |
| 10588 | First-order logic is Complete, and Compact, with the Löwenheim-Skolem Theorems [Shapiro] |
| 10298 | Some say that second-order logic is mathematics, not logic [Shapiro] |
| 10299 | If the aim of logic is to codify inferences, second-order logic is useless [Shapiro] |
| 10300 | Logical consequence can be defined in terms of the logical terminology [Shapiro] |
| 10290 | Second-order variables also range over properties, sets, relations or functions [Shapiro] |
| 10590 | Up Löwenheim-Skolem: if natural numbers satisfy wffs, then an infinite domain satisfies them [Shapiro] |
| 10296 | The Löwenheim-Skolem Theorems fail for second-order languages with standard semantics [Shapiro] |
| 10297 | The Löwenheim-Skolem theorem seems to be a defect of first-order logic [Shapiro] |
| 10292 | Downward Löwenheim-Skolem: if there's an infinite model, there is a countable model [Shapiro] |
| 10294 | Second-order logic has the expressive power for mathematics, but an unworkable model theory [Shapiro] |
| 10591 | Logicians use 'property' and 'set' interchangeably, with little hanging on it [Shapiro] |
| 13304 | Learned men gain more in one day than others do in a lifetime [Posidonius] |
| 20820 | Time is an interval of motion, or the measure of speed [Posidonius, by Stobaeus] |