65 ideas
| 9724 | Until the 1960s the only semantics was truth-tables [Enderton] |
| 15945 | Second-order set theory just adds a version of Replacement that quantifies over functions [Lavine] |
| 9705 | 'fld R' indicates the 'field' of all objects in the relation [Enderton] |
| 9704 | 'ran R' indicates the 'range' of objects being related to [Enderton] |
| 9703 | 'dom R' indicates the 'domain' of objects having a relation [Enderton] |
| 9710 | We write F:A→B to indicate that A maps into B (the output of F on A is in B) [Enderton] |
| 9707 | 'F(x)' is the unique value which F assumes for a value of x [Enderton] |
| 9699 | The 'powerset' of a set is all the subsets of a given set [Enderton] |
| 9700 | Two sets are 'disjoint' iff their intersection is empty [Enderton] |
| 9712 | A relation is 'symmetric' on a set if every ordered pair has the relation in both directions [Enderton] |
| 9713 | A relation is 'transitive' if it can be carried over from two ordered pairs to a third [Enderton] |
| 9701 | A 'relation' is a set of ordered pairs [Enderton] |
| 9702 | A 'domain' of a relation is the set of members of ordered pairs in the relation [Enderton] |
| 9708 | A function 'maps A into B' if the relating things are set A, and the things related to are all in B [Enderton] |
| 9709 | A function 'maps A onto B' if the relating things are set A, and the things related to are set B [Enderton] |
| 9711 | A relation is 'reflexive' on a set if every member bears the relation to itself [Enderton] |
| 9706 | A 'function' is a relation in which each object is related to just one other object [Enderton] |
| 9714 | A relation satisfies 'trichotomy' if all pairs are either relations, or contain identical objects [Enderton] |
| 9717 | A set is 'dominated' by another if a one-to-one function maps the first set into a subset of the second [Enderton] |
| 15914 | An 'upper bound' is the greatest member of a subset; there may be several of these, so there is a 'least' one [Lavine] |
| 15921 | Collections of things can't be too big, but collections by a rule seem unlimited in size [Lavine] |
| 15937 | Those who reject infinite collections also want to reject the Axiom of Choice [Lavine] |
| 9716 | We 'partition' a set into distinct subsets, according to each relation on its objects [Enderton] |
| 9715 | An 'equivalence relation' is a reflexive, symmetric and transitive binary relation [Enderton] |
| 15936 | The Power Set is just the collection of functions from one collection to another [Lavine] |
| 15899 | Replacement was immediately accepted, despite having very few implications [Lavine] |
| 15930 | Foundation says descending chains are of finite length, blocking circularity, or ungrounded sets [Lavine] |
| 15920 | Pure collections of things obey Choice, but collections defined by a rule may not [Lavine] |
| 15898 | The controversy was not about the Axiom of Choice, but about functions as arbitrary, or given by rules [Lavine] |
| 15919 | The 'logical' notion of class has some kind of definition or rule to characterise the class [Lavine] |
| 15900 | The iterative conception of set wasn't suggested until 1947 [Lavine] |
| 15931 | The iterative conception needs the Axiom of Infinity, to show how far we can iterate [Lavine] |
| 15932 | The iterative conception doesn't unify the axioms, and has had little impact on mathematical proofs [Lavine] |
| 15933 | Limitation of Size: if it's the same size as a set, it's a set; it uses Replacement [Lavine] |
| 15913 | A collection is 'well-ordered' if there is a least element, and all of its successors can be identified [Lavine] |
| 9722 | Inference not from content, but from the fact that it was said, is 'conversational implicature' [Enderton] |
| 15926 | Second-order logic presupposes a set of relations already fixed by the first-order domain [Lavine] |
| 9718 | Validity is either semantic (what preserves truth), or proof-theoretic (following procedures) [Enderton] |
| 15934 | Mathematical proof by contradiction needs the law of excluded middle [Lavine] |
| 9721 | A logical truth or tautology is a logical consequence of the empty set [Enderton] |
| 9994 | A truth assignment to the components of a wff 'satisfy' it if the wff is then True [Enderton] |
| 9719 | A proof theory is 'sound' if its valid inferences entail semantic validity [Enderton] |
| 9720 | A proof theory is 'complete' if semantically valid inferences entail proof-theoretic validity [Enderton] |
| 9995 | Proof in finite subsets is sufficient for proof in an infinite set [Enderton] |
| 9996 | Expressions are 'decidable' if inclusion in them (or not) can be proved [Enderton] |
| 9997 | For a reasonable language, the set of valid wff's can always be enumerated [Enderton] |
| 15907 | Mathematics is nowadays (thanks to set theory) regarded as the study of structure, not of quantity [Lavine] |
| 15942 | Every rational number, unlike every natural number, is divisible by some other number [Lavine] |
| 15922 | For the real numbers to form a set, we need the Continuum Hypothesis to be true [Lavine] |
| 18250 | Cauchy gave a necessary condition for the convergence of a sequence [Lavine] |
| 15904 | The two sides of the Cut are, roughly, the bounding commensurable ratios [Lavine] |
| 15912 | Counting results in well-ordering, and well-ordering makes counting possible [Lavine] |
| 15947 | The infinite is extrapolation from the experience of indefinitely large size [Lavine] |
| 15949 | The theory of infinity must rest on our inability to distinguish between very large sizes [Lavine] |
| 15940 | The intuitionist endorses only the potential infinite [Lavine] |
| 15909 | 'Aleph-0' is cardinality of the naturals, 'aleph-1' the next cardinal, 'aleph-ω' the ω-th cardinal [Lavine] |
| 15915 | Ordinals are basic to Cantor's transfinite, to count the sets [Lavine] |
| 15917 | Paradox: the class of all ordinals is well-ordered, so must have an ordinal as type - giving a bigger ordinal [Lavine] |
| 15918 | Paradox: there is no largest cardinal, but the class of everything seems to be the largest [Lavine] |
| 15929 | Set theory will found all of mathematics - except for the notion of proof [Lavine] |
| 15935 | Modern mathematics works up to isomorphism, and doesn't care what things 'really are' [Lavine] |
| 15928 | Intuitionism rejects set-theory to found mathematics [Lavine] |
| 9723 | Sentences with 'if' are only conditionals if they can read as A-implies-B [Enderton] |
| 1748 | Archelaus was the first person to say that the universe is boundless [Archelaus, by Diog. Laertius] |
| 5989 | Archelaus said life began in a primeval slime [Archelaus, by Schofield] |