48 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] |
7785 | The use of plurals doesn't commit us to sets; there do not exist individuals and collections [Boolos] |
10699 | Does a bowl of Cheerios contain all its sets and subsets? [Boolos] |
10225 | Monadic second-order logic might be understood in terms of plural quantifiers [Boolos, by Shapiro] |
10736 | Boolos showed how plural quantifiers can interpret monadic second-order logic [Boolos, by Linnebo] |
10780 | Any sentence of monadic second-order logic can be translated into plural first-order logic [Boolos, by Linnebo] |
10751 | Second-order logic needs the sets, and its consequence has epistemological problems [Rossberg] |
10757 | Henkin semantics has a second domain of predicates and relations (in upper case) [Rossberg] |
10759 | There are at least seven possible systems of semantics for second-order logic [Rossberg] |
10753 | Logical consequence is intuitively semantic, and captured by model theory [Rossberg] |
10752 | Γ |- S says S can be deduced from Γ; Γ |= S says a good model for Γ makes S true [Rossberg] |
10697 | Identity is clearly a logical concept, and greatly enhances predicate calculus [Boolos] |
10754 | In proof-theory, logical form is shown by the logical constants [Rossberg] |
13671 | Second-order quantifiers are just like plural quantifiers in ordinary language, with no extra ontology [Boolos, by Shapiro] |
10267 | We should understand second-order existential quantifiers as plural quantifiers [Boolos, by Shapiro] |
10698 | Plural forms have no more ontological commitment than to first-order objects [Boolos] |
7806 | Boolos invented plural quantification [Boolos, by Benardete,JA] |
10756 | A model is a domain, and an interpretation assigning objects, predicates, relations etc. [Rossberg] |
10758 | If models of a mathematical theory are all isomorphic, it is 'categorical', with essentially one model [Rossberg] |
10761 | Completeness can always be achieved by cunning model-design [Rossberg] |
10755 | A deductive system is only incomplete with respect to a formal semantics [Rossberg] |
10700 | First- and second-order quantifiers are two ways of referring to the same things [Boolos] |