38 ideas
| 10170 | While true-in-a-model seems relative, true-in-all-models seems not to be [Reck/Price] |
| 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] |
| 10166 | ZFC set theory has only 'pure' sets, without 'urelements' [Reck/Price] |
| 17759 | Ordinals play the central role in set theory, providing the model of well-ordering [Walicki] |
| 17741 | To determine the patterns in logic, one must identify its 'building blocks' [Walicki] |
| 10175 | Three types of variable in second-order logic, for objects, functions, and predicates/sets [Reck/Price] |
| 17747 | A 'model' of a theory specifies interpreting a language in a domain to make all theorems true [Walicki] |
| 17748 | The L-S Theorem says no theory (even of reals) says more than a natural number theory [Walicki] |
| 17763 | Axiomatic systems are purely syntactic, and do not presuppose any interpretation [Walicki] |
| 17761 | A compact axiomatisation makes it possible to understand a field as a whole [Walicki] |
| 17757 | Members of ordinals are ordinals, and also subsets of ordinals [Walicki] |
| 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] |
| 10165 | 'Analysis' is the theory of the real numbers [Reck/Price] |
| 17762 | In non-Euclidean geometry, all Euclidean theorems are valid that avoid the fifth postulate [Walicki] |
| 10174 | Mereological arithmetic needs infinite objects, and function definitions [Reck/Price] |
| 10164 | Peano Arithmetic can have three second-order axioms, plus '1' and 'successor' [Reck/Price] |
| 17754 | Inductive proof depends on the choice of the ordering [Walicki] |
| 10172 | Set-theory gives a unified and an explicit basis for mathematics [Reck/Price] |
| 10167 | Structuralism emerged from abstract algebra, axioms, and set theory and its structures [Reck/Price] |
| 10169 | Relativist Structuralism just stipulates one successful model as its arithmetic [Reck/Price] |
| 10179 | There are 'particular' structures, and 'universal' structures (what the former have in common) [Reck/Price] |
| 10181 | Pattern Structuralism studies what isomorphic arithmetic models have in common [Reck/Price] |
| 10182 | There are Formalist, Relativist, Universalist and Pattern structuralism [Reck/Price] |
| 10168 | Formalist Structuralism says the ontology is vacuous, or formal, or inference relations [Reck/Price] |
| 10178 | Maybe we should talk of an infinity of 'possible' objects, to avoid arithmetic being vacuous [Reck/Price] |
| 10176 | Universalist Structuralism is based on generalised if-then claims, not one particular model [Reck/Price] |
| 10177 | Universalist Structuralism eliminates the base element, as a variable, which is then quantified out [Reck/Price] |
| 10171 | The existence of an infinite set is assumed by Relativist Structuralism [Reck/Price] |
| 10173 | A nominalist might avoid abstract objects by just appealing to mereological sums [Reck/Price] |
| 17742 | Scotus based modality on semantic consistency, instead of on what the future could allow [Walicki] |
| 7517 | I could take a healthy infant and train it up to be any type of specialist I choose [Watson,JB] |