66 ideas
| 9542 | The best known axiomatization of PL is Whitehead/Russell, with four axioms and two rules [Russell/Whitehead, by Hughes/Cresswell] |
| 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] |
| 21720 | Russell saw Reducibility as legitimate for reducing classes to logic [Linsky,B on Russell/Whitehead] |
| 10044 | Russell denies extensional sets, because the null can't be a collection, and the singleton is just its element [Russell/Whitehead, by Shapiro] |
| 18208 | We regard classes as mere symbolic or linguistic conveniences [Russell/Whitehead] |
| 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] |
| 8204 | Lewis's 'strict implication' preserved Russell's confusion of 'if...then' with implication [Quine on Russell/Whitehead] |
| 9359 | Russell's implication means that random sentences imply one another [Lewis,CI on Russell/Whitehead] |
| 21707 | Russell unusually saw logic as 'interpreted' (though very general, and neutral) [Russell/Whitehead, by Linsky,B] |
| 10036 | In 'Principia' a new abstract theory of relations appeared, and was applied [Russell/Whitehead, by Gödel] |
| 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] |
| 18248 | A real number is the class of rationals less than the number [Russell/Whitehead, by Shapiro] |
| 18152 | Russell takes numbers to be classes, but then reduces the classes to numerical quantifiers [Russell/Whitehead, by Bostock] |
| 10025 | Russell and Whitehead took arithmetic to be higher-order logic [Russell/Whitehead, by Hodes] |
| 8683 | Russell and Whitehead were not realists, but embraced nearly all of maths in logic [Russell/Whitehead, by Friend] |
| 10037 | 'Principia' lacks a precise statement of the syntax [Gödel on Russell/Whitehead] |
| 10093 | The ramified theory of types used propositional functions, and covered bound variables [Russell/Whitehead, by George/Velleman] |
| 8691 | The Russell/Whitehead type theory was limited, and was not really logic [Friend on Russell/Whitehead] |
| 10305 | In 'Principia Mathematica', logic is exceeded in the axioms of infinity and reducibility, and in the domains [Bernays on Russell/Whitehead] |
| 8684 | Russell and Whitehead consider the paradoxes to indicate that we create mathematical reality [Russell/Whitehead, by Friend] |
| 8746 | To avoid vicious circularity Russell produced ramified type theory, but Ramsey simplified it [Russell/Whitehead, by Shapiro] |
| 16643 | Accidents always remain suited to a subject [Bonaventura] |
| 16696 | Successive things reduce to permanent things [Bonaventura] |
| 12033 | An object is identical with itself, and no different indiscernible object can share that [Russell/Whitehead, by Adams,RM] |
| 9723 | Sentences with 'if' are only conditionals if they can read as A-implies-B [Enderton] |
| 10040 | Russell showed, through the paradoxes, that our basic logical intuitions are self-contradictory [Russell/Whitehead, by Gödel] |
| 21725 | The multiple relations theory says assertions about propositions are about their ingredients [Russell/Whitehead, by Linsky,B] |
| 23474 | A judgement is a complex entity, of mind and various objects [Russell/Whitehead] |
| 23455 | The meaning of 'Socrates is human' is completed by a judgement [Russell/Whitehead] |
| 23480 | The multiple relation theory of judgement couldn't explain the unity of sentences [Morris,M on Russell/Whitehead] |
| 18275 | Only the act of judging completes the meaning of a statement [Russell/Whitehead] |
| 23453 | Propositions as objects of judgement don't exist, because we judge several objects, not one [Russell/Whitehead] |