56 ideas
| 9724 | Until the 1960s the only semantics was truth-tables [Enderton] |
| 9065 | S5 collapses iterated modalities (◊□P→□P, and ◊◊P→◊P) [Keefe/Smith] |
| 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] |
| 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] |
| 9064 | Objects such as a cloud or Mount Everest seem to have fuzzy boundaries in nature [Keefe/Smith] |
| 9044 | If someone is borderline tall, no further information is likely to resolve the question [Keefe/Smith] |
| 9048 | The simplest approach, that vagueness is just ignorance, retains classical logic and semantics [Keefe/Smith] |
| 9055 | The epistemic view of vagueness must explain why we don't know the predicate boundary [Keefe/Smith] |
| 9049 | Supervaluationism keeps true-or-false where precision can be produced, but not otherwise [Keefe/Smith] |
| 9056 | Vague statements lack truth value if attempts to make them precise fail [Keefe/Smith] |
| 9058 | Some of the principles of classical logic still fail with supervaluationism [Keefe/Smith] |
| 9059 | The semantics of supervaluation (e.g. disjunction and quantification) is not classical [Keefe/Smith] |
| 9060 | Supervaluation misunderstands vagueness, treating it as a failure to make things precise [Keefe/Smith] |
| 9050 | A third truth-value at borderlines might be 'indeterminate', or a value somewhere between 0 and 1 [Keefe/Smith] |
| 9061 | People can't be placed in a precise order according to how 'nice' they are [Keefe/Smith] |
| 9062 | If truth-values for vagueness range from 0 to 1, there must be someone who is 'completely tall' [Keefe/Smith] |
| 9063 | How do we decide if my coat is red to degree 0.322 or 0.321? [Keefe/Smith] |
| 9045 | Vague predicates involve uncertain properties, uncertain objects, and paradoxes of gradual change [Keefe/Smith] |
| 9047 | Many vague predicates are multi-dimensional; 'big' involves height and volume; heaps include arrangement [Keefe/Smith] |
| 9053 | If there is a precise borderline area, that is not a case of vagueness [Keefe/Smith] |
| 9723 | Sentences with 'if' are only conditionals if they can read as A-implies-B [Enderton] |
| 7907 | Human killing is worse if the victim is virtuous [Buddhaghosa] |