44 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] |
| 8780 | Attributes are functions, not objects; this distinguishes 'square of 2' from 'double of 2' [Geach] |
| 11910 | Being 'the same' is meaningless, unless we specify 'the same X' [Geach] |
| 8775 | A big flea is a small animal, so 'big' and 'small' cannot be acquired by abstraction [Geach] |
| 8776 | We cannot learn relations by abstraction, because their converse must be learned too [Geach] |
| 2567 | You can't define real mental states in terms of behaviour that never happens [Geach] |
| 2568 | Beliefs aren't tied to particular behaviours [Geach] |
| 8781 | The mind does not lift concepts from experience; it creates them, and then applies them [Geach] |
| 8769 | If someone has aphasia but can still play chess, they clearly have concepts [Geach] |
| 8770 | 'Abstractionism' is acquiring a concept by picking out one experience amongst a group [Geach] |
| 8771 | 'Or' and 'not' are not to be found in the sensible world, or even in the world of inner experience [Geach] |
| 8772 | We can't acquire number-concepts by extracting the number from the things being counted [Geach] |
| 8773 | Abstractionists can't explain counting, because it must precede experience of objects [Geach] |
| 8774 | The numbers don't exist in nature, so they cannot have been abstracted from there into our languages [Geach] |
| 8778 | Blind people can use colour words like 'red' perfectly intelligently [Geach] |
| 8777 | If 'black' and 'cat' can be used in the absence of such objects, how can such usage be abstracted? [Geach] |
| 8779 | We can form two different abstract concepts that apply to a single unified experience [Geach] |
| 22236 | The big question of the Renaissance was how to govern everything, from the state to children [Foucault] |