55 ideas
9724 | Until the 1960s the only semantics was truth-tables [Enderton] |
9707 | 'F(x)' is the unique value which F assumes for a value of x [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] |
9703 | 'dom R' indicates the 'domain' of objects having a relation [Enderton] |
9710 | We write F:A→B to indicate that A maps into B (the output of F on A is in B) [Enderton] |
13201 | ∈ says the whole set is in the other; ⊆ says the members of the subset are in the other [Enderton] |
13206 | A 'linear or total ordering' must be transitive and satisfy trichotomy [Enderton] |
13204 | The 'ordered pair' <x,y> is defined to be {{x}, {x,y}} [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] |
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] |
9701 | A 'relation' is a set of ordered pairs [Enderton] |
9702 | A 'domain' of a relation is the set of members of ordered pairs in the relation [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] |
9706 | A 'function' is a relation in which each object is related to just one other object [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] |
9716 | We 'partition' a set into distinct subsets, according to each relation on its objects [Enderton] |
9715 | An 'equivalence relation' is a reflexive, symmetric and transitive binary relation [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] |
10775 | The axiom of choice now seems acceptable and obvious (if it is meaningful) [Tharp] |
9722 | Inference not from content, but from the fact that it was said, is 'conversational implicature' [Enderton] |
10766 | Logic is either for demonstration, or for characterizing structures [Tharp] |
10767 | Elementary logic is complete, but cannot capture mathematics [Tharp] |
10769 | Second-order logic isn't provable, but will express set-theory and classic problems [Tharp] |
9718 | Validity is either semantic (what preserves truth), or proof-theoretic (following procedures) [Enderton] |
10762 | In sentential logic there is a simple proof that all truth functions can be reduced to 'not' and 'and' [Tharp] |
10776 | The main quantifiers extend 'and' and 'or' to infinite domains [Tharp] |
10774 | There are at least five unorthodox quantifiers that could be used [Tharp] |
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] |
10777 | Skolem mistakenly inferred that Cantor's conceptions were illusory [Tharp] |
10773 | The Löwenheim-Skolem property is a limitation (e.g. can't say there are uncountably many reals) [Tharp] |
9719 | A proof theory is 'sound' if its valid inferences entail semantic validity [Enderton] |
10765 | Soundness would seem to be an essential requirement of a proof procedure [Tharp] |
9720 | A proof theory is 'complete' if semantically valid inferences entail proof-theoretic validity [Enderton] |
10763 | Completeness and compactness together give axiomatizability [Tharp] |
10770 | If completeness fails there is no algorithm to list the valid formulas [Tharp] |
9995 | Proof in finite subsets is sufficient for proof in an infinite set [Enderton] |
10771 | Compactness is important for major theories which have infinitely many axioms [Tharp] |
10772 | Compactness blocks infinite expansion, and admits non-standard models [Tharp] |
9996 | Expressions are 'decidable' if inclusion in them (or not) can be proved [Enderton] |
10764 | A complete logic has an effective enumeration of the valid formulas [Tharp] |
9997 | For a reasonable language, the set of valid wff's can always be enumerated [Enderton] |
10768 | Effective enumeration might be proved but not specified, so it won't guarantee knowledge [Tharp] |
9723 | Sentences with 'if' are only conditionals if they can read as A-implies-B [Enderton] |
21650 | No language is semantically referential; it all occurs at the level of thought or utterance [Pietroski, by Hofweber] |