45 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] |
| 11976 | Aristotelian essentialism says essences are not relative to specification [Lewis] |
| 11978 | Causal necessities hold in all worlds compatible with the laws of nature [Lewis] |
| 11979 | It doesn't take the whole of a possible Humphrey to win the election [Lewis] |
| 16994 | Counterpart theory is bizarre, as no one cares what happens to a mere counterpart [Kripke on Lewis] |
| 11974 | Counterparts are not the original thing, but resemble it more than other things do [Lewis] |
| 11975 | If the closest resembler to you is in fact quite unlike you, then you have no counterpart [Lewis] |
| 11977 | Essential attributes are those shared with all the counterparts [Lewis] |
| 12790 | Generalisations must be invariant to explain anything [Leuridan] |
| 12789 | Biological functions are explained by disposition, or by causal role [Leuridan] |
| 14388 | Mechanisms must produce macro-level regularities, but that needs micro-level regularities [Leuridan] |
| 14386 | Mechanisms are ontologically dependent on regularities [Leuridan] |
| 12787 | Mechanisms can't explain on their own, as their models rest on pragmatic regularities [Leuridan] |
| 14384 | We can show that regularities and pragmatic laws are more basic than mechanisms [Leuridan] |
| 14389 | There is nothing wrong with an infinite regress of mechanisms and regularities [Leuridan] |
| 14387 | Rather than dispositions, functions may be the element that brought a thing into existence [Leuridan] |
| 14382 | Pragmatic laws allow prediction and explanation, to the extent that reality is stable [Leuridan] |
| 14385 | Strict regularities are rarely discovered in life sciences [Leuridan] |
| 14383 | A 'law of nature' is just a regularity, not some entity that causes the regularity [Leuridan] |