52 ideas
9724 | Until the 1960s the only semantics was truth-tables [Enderton] |
10702 | Set theory's three roles: taming the infinite, subject-matter of mathematics, and modes of reasoning [Potter] |
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] |
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] |
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] |
10713 | Usually the only reason given for accepting the empty set is convenience [Potter] |
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] |
13044 | Infinity: There is at least one limit level [Potter] |
10708 | Nowadays we derive our conception of collections from the dependence between them [Potter] |
13546 | The 'limitation of size' principles say whether properties collectivise depends on the number of objects [Potter] |
10707 | Mereology elides the distinction between the cards in a pack and the suits [Potter] |
9722 | Inference not from content, but from the fact that it was said, is 'conversational implicature' [Enderton] |
10704 | We can formalize second-order formation rules, but not inference rules [Potter] |
18755 | Validity is explained as truth in all models, because that relies on the logical terms [McGee] |
9718 | Validity is either semantic (what preserves truth), or proof-theoretic (following procedures) [Enderton] |
18751 | Natural language includes connectives like 'because' which are not truth-functional [McGee] |
18761 | Second-order variables need to range over more than collections of first-order objects [McGee] |
10703 | Supposing axioms (rather than accepting them) give truths, but they are conditional [Potter] |
18753 | An ontologically secure semantics for predicate calculus relies on sets [McGee] |
9721 | A logical truth or tautology is a logical consequence of the empty set [Enderton] |
18754 | Logically valid sentences are analytic truths which are just true because of their logical words [McGee] |
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] |
18757 | Soundness theorems are uninformative, because they rely on soundness in their proofs [McGee] |
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] |
10712 | If set theory didn't found mathematics, it is still needed to count infinite sets [Potter] |
18760 | The culmination of Euclidean geometry was axioms that made all models isomorphic [McGee] |
17882 | It is remarkable that all natural number arithmetic derives from just the Peano Axioms [Potter] |
13043 | A relation is a set consisting entirely of ordered pairs [Potter] |
13042 | If dependence is well-founded, with no infinite backward chains, this implies substances [Potter] |
13041 | Collections have fixed members, but fusions can be carved in innumerable ways [Potter] |
10709 | Priority is a modality, arising from collections and members [Potter] |
9723 | Sentences with 'if' are only conditionals if they can read as A-implies-B [Enderton] |
18762 | A maxim claims that if we are allowed to assert a sentence, that means it must be true [McGee] |