58 ideas
| 18487 | We want to know what makes sentences true, rather than defining 'true' [McFetridge] |
| 13913 | The four 'perfect syllogisms' are called Barbara, Celarent, Darii and Ferio [Engelbretsen/Sayward] |
| 13914 | Syllogistic logic has one rule: what is affirmed/denied of wholes is affirmed/denied of their parts [Engelbretsen/Sayward] |
| 13915 | Syllogistic can't handle sentences with singular terms, or relational terms, or compound sentences [Engelbretsen/Sayward] |
| 13916 | Term logic uses expression letters and brackets, and '-' for negative terms, and '+' for compound terms [Engelbretsen/Sayward] |
| 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] |
| 9722 | Inference not from content, but from the fact that it was said, is 'conversational implicature' [Enderton] |
| 13850 | In modern logic all formal validity can be characterised syntactically [Engelbretsen/Sayward] |
| 13849 | Classical logic rests on truth and models, where constructivist logic rests on defence and refutation [Engelbretsen/Sayward] |
| 9718 | Validity is either semantic (what preserves truth), or proof-theoretic (following procedures) [Enderton] |
| 13851 | Unlike most other signs, = cannot be eliminated [Engelbretsen/Sayward] |
| 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] |
| 13852 | Axioms are ω-incomplete if the instances are all derivable, but the universal quantification isn't [Engelbretsen/Sayward] |
| 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] |
| 18488 | We normally explain natural events by citing further facts [McFetridge] |
| 12184 | Logical necessity overrules all other necessities [McFetridge] |
| 15083 | The fundamental case of logical necessity is the valid conclusion of an inference [McFetridge, by Hale] |
| 15084 | In the McFetridge view, logical necessity means a consequent must be true if the antecedent is [McFetridge, by Hale] |
| 12180 | Logical necessity requires that a valid argument be necessary [McFetridge] |
| 12181 | Traditionally, logical necessity is the strongest, and entails any other necessities [McFetridge] |
| 12183 | It is only logical necessity if there is absolutely no sense in which it could be false [McFetridge] |
| 12192 | The mark of logical necessity is deduction from any suppositions whatever [McFetridge] |
| 12182 | We assert epistemic possibility without commitment to logical possibility [McFetridge] |
| 9723 | Sentences with 'if' are only conditionals if they can read as A-implies-B [Enderton] |
| 12187 | Objectual modal realists believe in possible worlds; non-objectual ones rest it on the actual world [McFetridge] |
| 12186 | Modal realists hold that necessities and possibilities are part of the totality of facts [McFetridge] |