27 ideas
| 10888 | Sets can be defined by 'enumeration', or by 'abstraction' (based on a property) [Zalabardo] |
| 10889 | The 'Cartesian Product' of two sets relates them by pairing every element with every element [Zalabardo] |
| 10890 | A 'partial ordering' is reflexive, antisymmetric and transitive [Zalabardo] |
| 10886 | Determinacy: an object is either in a set, or it isn't [Zalabardo] |
| 10887 | Specification: Determinate totals of objects always make a set [Zalabardo] |
| 10897 | A first-order 'sentence' is a formula with no free variables [Zalabardo] |
| 18755 | Validity is explained as truth in all models, because that relies on the logical terms [McGee] |
| 10893 | Γ |= φ for sentences if φ is true when all of Γ is true [Zalabardo] |
| 10899 | Γ |= φ if φ is true when all of Γ is true, for all structures and interpretations [Zalabardo] |
| 18751 | Natural language includes connectives like 'because' which are not truth-functional [McGee] |
| 10896 | Propositional logic just needs ¬, and one of ∧, ∨ and → [Zalabardo] |
| 18761 | Second-order variables need to range over more than collections of first-order objects [McGee] |
| 10898 | The semantics shows how truth values depend on instantiations of properties and relations [Zalabardo] |
| 10902 | We can do semantics by looking at given propositions, or by building new ones [Zalabardo] |
| 18753 | An ontologically secure semantics for predicate calculus relies on sets [McGee] |
| 10892 | We make a truth assignment to T and F, which may be true and false, but merely differ from one another [Zalabardo] |
| 10900 | Logically true sentences are true in all structures [Zalabardo] |
| 10895 | 'Logically true' (|= φ) is true for every truth-assignment [Zalabardo] |
| 18754 | Logically valid sentences are analytic truths which are just true because of their logical words [McGee] |
| 10901 | Some formulas are 'satisfiable' if there is a structure and interpretation that makes them true [Zalabardo] |
| 10894 | A sentence-set is 'satisfiable' if at least one truth-assignment makes them all true [Zalabardo] |
| 10903 | A structure models a sentence if it is true in the model, and a set of sentences if they are all true in the model [Zalabardo] |
| 18757 | Soundness theorems are uninformative, because they rely on soundness in their proofs [McGee] |
| 18760 | The culmination of Euclidean geometry was axioms that made all models isomorphic [McGee] |
| 10891 | If a set is defined by induction, then proof by induction can be applied to it [Zalabardo] |
| 18762 | A maxim claims that if we are allowed to assert a sentence, that means it must be true [McGee] |
| 20239 | Unlike us, the early Greeks thought envy was a good thing, and hope a bad thing [Hesiod, by Nietzsche] |