36 ideas
| 10476 | The idea that groups of concepts could be 'implicitly defined' was abandoned [Hodges,W] |
| 17749 | Post proved the consistency of propositional logic in 1921 [Walicki] |
| 17765 | Propositional language can only relate statements as the same or as different [Walicki] |
| 17764 | Boolean connectives are interpreted as functions on the set {1,0} [Walicki] |
| 17752 | The empty set is useful for defining sets by properties, when the members are not yet known [Walicki] |
| 17753 | The empty set avoids having to take special precautions in case members vanish [Walicki] |
| 17759 | Ordinals play the central role in set theory, providing the model of well-ordering [Walicki] |
| 10282 | Logic is the study of sound argument, or of certain artificial languages (or applying the latter to the former) [Hodges,W] |
| 17741 | To determine the patterns in logic, one must identify its 'building blocks' [Walicki] |
| 10478 | Since first-order languages are complete, |= and |- have the same meaning [Hodges,W] |
| 10477 | |= in model-theory means 'logical consequence' - it holds in all models [Hodges,W] |
| 10283 | A formula needs an 'interpretation' of its constants, and a 'valuation' of its variables [Hodges,W] |
| 10284 | There are three different standard presentations of semantics [Hodges,W] |
| 10285 | I |= φ means that the formula φ is true in the interpretation I [Hodges,W] |
| 10474 | |= should be read as 'is a model for' or 'satisfies' [Hodges,W] |
| 17747 | A 'model' of a theory specifies interpreting a language in a domain to make all theorems true [Walicki] |
| 10473 | Model theory studies formal or natural language-interpretation using set-theory [Hodges,W] |
| 10475 | A 'structure' is an interpretation specifying objects and classes of quantification [Hodges,W] |
| 10481 | Models in model theory are structures, not sets of descriptions [Hodges,W] |
| 10288 | Down Löwenheim-Skolem: if a countable language has a consistent theory, that has a countable model [Hodges,W] |
| 10289 | Up Löwenheim-Skolem: if infinite models, then arbitrarily large models [Hodges,W] |
| 17748 | The L-S Theorem says no theory (even of reals) says more than a natural number theory [Walicki] |
| 17761 | A compact axiomatisation makes it possible to understand a field as a whole [Walicki] |
| 17763 | Axiomatic systems are purely syntactic, and do not presuppose any interpretation [Walicki] |
| 10287 | If a first-order theory entails a sentence, there is a finite subset of the theory which entails it [Hodges,W] |
| 17758 | Ordinals are transitive sets of transitive sets; or transitive sets totally ordered by inclusion [Walicki] |
| 17755 | Ordinals are the empty set, union with the singleton, and any arbitrary union of ordinals [Walicki] |
| 17756 | The union of finite ordinals is the first 'limit ordinal'; 2ω is the second... [Walicki] |
| 17760 | Two infinite ordinals can represent a single infinite cardinal [Walicki] |
| 17757 | Members of ordinals are ordinals, and also subsets of ordinals [Walicki] |
| 10480 | First-order logic can't discriminate between one infinite cardinal and another [Hodges,W] |
| 17762 | In non-Euclidean geometry, all Euclidean theorems are valid that avoid the fifth postulate [Walicki] |
| 17754 | Inductive proof depends on the choice of the ordering [Walicki] |
| 10286 | A 'set' is a mathematically well-behaved class [Hodges,W] |
| 17742 | Scotus based modality on semantic consistency, instead of on what the future could allow [Walicki] |
| 3061 | Anaxarchus said that he was not even sure that he knew nothing [Anaxarchus, by Diog. Laertius] |