53 ideas
| 9724 | Until the 1960s the only semantics was truth-tables [Enderton] |
| 9703 | 'dom R' indicates the 'domain' of objects having a relation [Enderton] |
| 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] |
| 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] |
| 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] |
| 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] |
| 9702 | A 'domain' of a relation is the set of members of ordered pairs in the relation [Enderton] |
| 9701 | A 'relation' is a set of ordered pairs [Enderton] |
| 9706 | A 'function' is a relation in which each object is related to just one other object [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] |
| 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] |
| 10859 | A set is 'well-ordered' if every subset has a first element [Clegg] |
| 10857 | Set theory made a closer study of infinity possible [Clegg] |
| 10864 | Any set can always generate a larger set - its powerset, of subsets [Clegg] |
| 9715 | An 'equivalence relation' is a reflexive, symmetric and transitive binary relation [Enderton] |
| 9716 | We 'partition' a set into distinct subsets, according to each relation on its objects [Enderton] |
| 10872 | Extensionality: Two sets are equal if and only if they have the same elements [Clegg] |
| 10875 | Pairing: For any two sets there exists a set to which they both belong [Clegg] |
| 10876 | Unions: There is a set of all the elements which belong to at least one set in a collection [Clegg] |
| 10878 | Infinity: There exists a set of the empty set and the successor of each element [Clegg] |
| 10877 | Powers: All the subsets of a given set form their own new powerset [Clegg] |
| 10879 | Choice: For every set a mechanism will choose one member of any non-empty subset [Clegg] |
| 10871 | Axiom of Existence: there exists at least one set [Clegg] |
| 10874 | Specification: a condition applied to a set will always produce a new set [Clegg] |
| 9722 | Inference not from content, but from the fact that it was said, is 'conversational implicature' [Enderton] |
| 9718 | Validity is either semantic (what preserves truth), or proof-theoretic (following procedures) [Enderton] |
| 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] |
| 10880 | Mathematics can be 'pure' (unapplied), 'real' (physically grounded); or 'applied' (just applicable) [Clegg] |
| 10861 | Beyond infinity cardinals and ordinals can come apart [Clegg] |
| 10860 | An ordinal number is defined by the set that comes before it [Clegg] |
| 10854 | Transcendental numbers can't be fitted to finite equations [Clegg] |
| 10858 | By adding an axis of imaginary numbers, we get the useful 'number plane' instead of number line [Clegg] |
| 10853 | Either lack of zero made early mathematics geometrical, or the geometrical approach made zero meaningless [Clegg] |
| 10866 | Cantor's account of infinities has the shaky foundation of irrational numbers [Clegg] |
| 10869 | The Continuum Hypothesis is independent of the axioms of set theory [Clegg] |
| 10862 | The 'continuum hypothesis' says aleph-one is the cardinality of the reals [Clegg] |
| 17945 | Forms are not a theory of universals, but an attempt to explain how predication is possible [Nehamas] |
| 17946 | Only Tallness really is tall, and other inferior tall things merely participate in the tallness [Nehamas] |
| 9723 | Sentences with 'if' are only conditionals if they can read as A-implies-B [Enderton] |
| 17944 | 'Episteme' is better translated as 'understanding' than as 'knowledge' [Nehamas] |