75 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] |
| 13201 | ∈ says the whole set is in the other; ⊆ says the members of the subset are in the other [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] |
| 13204 | The 'ordered pair' <x,y> is defined to be {{x}, {x,y}} [Enderton] |
| 13206 | A 'linear or total ordering' must be transitive and satisfy trichotomy [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] |
| 13200 | Note that {Φ} =/= Φ, because Φ ∈ {Φ} but Φ ∉ Φ [Enderton] |
| 13199 | The empty set may look pointless, but many sets can be constructed from it [Enderton] |
| 13203 | The singleton is defined using the pairing axiom (as {x,x}) [Enderton] |
| 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] |
| 13202 | Fraenkel added Replacement, to give a theory of ordinal numbers [Enderton] |
| 13205 | We can only define functions if Choice tells us which items are involved [Enderton] |
| 10676 | The Axiom of Choice is a non-logical principle of set-theory [Hossack] |
| 10686 | The Axiom of Choice guarantees a one-one correspondence from sets to ordinals [Hossack] |
| 23623 | Predicativism says only predicated sets exist [Hossack] |
| 23624 | The iterative conception has to appropriate Replacement, to justify the ordinals [Hossack] |
| 23625 | Limitation of Size justifies Replacement, but then has to appropriate Power Set [Hossack] |
| 10687 | Maybe we reduce sets to ordinals, rather than the other way round [Hossack] |
| 10677 | Extensional mereology needs two definitions and two axioms [Hossack] |
| 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] |
| 23628 | The connective 'and' can have an order-sensitive meaning, as 'and then' [Hossack] |
| 23627 | 'Before' and 'after' are not two relations, but one relation with two orders [Hossack] |
| 10671 | Plural definite descriptions pick out the largest class of things that fit the description [Hossack] |
| 10666 | Plural reference will refer to complex facts without postulating complex things [Hossack] |
| 10669 | Plural reference is just an abbreviation when properties are distributive, but not otherwise [Hossack] |
| 10675 | A plural comprehension principle says there are some things one of which meets some condition [Hossack] |
| 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] |
| 10673 | Plural language can discuss without inconsistency things that are not members of themselves [Hossack] |
| 10680 | The theory of the transfinite needs the ordinal numbers [Hossack] |
| 10684 | I take the real numbers to be just lengths [Hossack] |
| 23626 | Transfinite ordinals are needed in proof theory, and for recursive functions and computability [Hossack] |
| 10674 | A plural language gives a single comprehensive induction axiom for arithmetic [Hossack] |
| 10681 | In arithmetic singularists need sets as the instantiator of numeric properties [Hossack] |
| 10685 | Set theory is the science of infinity [Hossack] |
| 23621 | Numbers are properties, not sets (because numbers are magnitudes) [Hossack] |
| 23622 | We can only mentally construct potential infinities, but maths needs actual infinities [Hossack] |
| 10668 | We are committed to a 'group' of children, if they are sitting in a circle [Hossack] |
| 10664 | Complex particulars are either masses, or composites, or sets [Hossack] |
| 10678 | The relation of composition is indispensable to the part-whole relation for individuals [Hossack] |
| 10665 | Leibniz's Law argues against atomism - water is wet, unlike water molecules [Hossack] |
| 10682 | The fusion of five rectangles can decompose into more than five parts that are rectangles [Hossack] |
| 9723 | Sentences with 'if' are only conditionals if they can read as A-implies-B [Enderton] |
| 19558 | Our own intuitions about whether we know tend to vacillate [Cohen,S] |
| 19561 | We shouldn't jump too quickly to a contextualist account of claims to know [Cohen,S] |
| 19563 | The context sensitivity of knowledge derives from its justification [Cohen,S] |
| 19560 | Contextualism is good because it allows knowledge, but bad because 'knowing' is less valued [Cohen,S] |
| 12893 | Contextualism says sceptical arguments are true, relative to their strict context [Cohen,S] |
| 12896 | Knowledge is context-sensitive, because justification is [Cohen,S] |
| 12894 | There aren't invariant high standards for knowledge, because even those can be raised [Cohen,S] |
| 19559 | Contextualists slightly concede scepticism, but only in extremely strict contexts [Cohen,S] |
| 10663 | A thought can refer to many things, but only predicate a universal and affirm a state of affairs [Hossack] |
| 10683 | We could ignore space, and just talk of the shape of matter [Hossack] |