38 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] |
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] |
15717 | Using Choice, you can cut up a small ball and make an enormous one from the pieces [Kaplan/Kaplan] |
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] |
15712 | 1 and 0, then add for naturals, subtract for negatives, divide for rationals, take roots for irrationals [Kaplan/Kaplan] |
15711 | The rationals are everywhere - the irrationals are everywhere else [Kaplan/Kaplan] |
15714 | 'Commutative' laws say order makes no difference; 'associative' laws say groupings make no difference [Kaplan/Kaplan] |
15715 | 'Distributive' laws say if you add then multiply, or multiply then add, you get the same result [Kaplan/Kaplan] |
9723 | Sentences with 'if' are only conditionals if they can read as A-implies-B [Enderton] |
15713 | The first million numbers confirm that no number is greater than a million [Kaplan/Kaplan] |
7861 | Libet says the processes initiated in the cortex can still be consciously changed [Libet, by Papineau] |
6660 | Libet found conscious choice 0.2 secs before movement, well after unconscious 'readiness potential' [Libet, by Lowe] |