54 ideas
| 9724 | Until the 1960s the only semantics was truth-tables [Enderton] |
| 7791 | The simplest of the logics based on possible worlds is Lewis's S5 [Lewis,CI, by Girle] |
| 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] |
| 9358 | There are several logics, none of which will ever derive falsehoods from truth [Lewis,CI] |
| 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] |
| 9357 | Excluded middle is just our preference for a simplified dichotomy in experience [Lewis,CI] |
| 9364 | Names represent a uniformity in experience, or they name nothing [Lewis,CI] |
| 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] |
| 12887 | A whole must have one characteristic, an internal relation, and a structure [Rescher/Oppenheim] |
| 11002 | Equating necessity with informal provability is the S4 conception of necessity [Lewis,CI, by Read] |
| 9362 | Necessary truths are those we will maintain no matter what [Lewis,CI] |
| 7803 | Modal logic began with translation difficulties for 'If...then' [Lewis,CI, by Girle] |
| 9723 | Sentences with 'if' are only conditionals if they can read as A-implies-B [Enderton] |
| 9365 | We can maintain a priori principles come what may, but we can also change them [Lewis,CI] |
| 21500 | We rely on memory for empirical beliefs because they mutually support one another [Lewis,CI] |
| 21501 | If we doubt memories we cannot assess our doubt, or what is being doubted [Lewis,CI] |
| 6556 | If anything is to be probable, then something must be certain [Lewis,CI] |
| 21498 | Congruents assertions increase the probability of each individual assertion in the set [Lewis,CI] |
| 5828 | Extension is the class of things, intension is the correct definition of the thing, and intension determines extension [Lewis,CI] |
| 9361 | We have to separate the mathematical from physical phenomena by abstraction [Lewis,CI] |
| 9363 | Science seeks classification which will discover laws, essences, and predictions [Lewis,CI] |