31 ideas
13838 | A decent modern definition should always imply a semantics [Hacking] |
10170 | While true-in-a-model seems relative, true-in-all-models seems not to be [Reck/Price] |
13834 | Gentzen's Cut Rule (or transitivity of deduction) is 'If A |- B and B |- C, then A |- C' [Hacking] |
13835 | Only Cut reduces complexity, so logic is constructive without it, and it can be dispensed with [Hacking] |
13833 | 'Thinning' ('dilution') is the key difference between deduction (which allows it) and induction [Hacking] |
10166 | ZFC set theory has only 'pure' sets, without 'urelements' [Reck/Price] |
13845 | The various logics are abstractions made from terms like 'if...then' in English [Hacking] |
13840 | First-order logic is the strongest complete compact theory with Löwenheim-Skolem [Hacking] |
13844 | A limitation of first-order logic is that it cannot handle branching quantifiers [Hacking] |
13842 | Second-order completeness seems to need intensional entities and possible worlds [Hacking] |
13837 | With a pure notion of truth and consequence, the meanings of connectives are fixed syntactically [Hacking] |
13839 | Perhaps variables could be dispensed with, by arrows joining places in the scope of quantifiers [Hacking] |
10175 | Three types of variable in second-order logic, for objects, functions, and predicates/sets [Reck/Price] |
13843 | If it is a logic, the Löwenheim-Skolem theorem holds for it [Hacking] |
10165 | 'Analysis' is the theory of the real numbers [Reck/Price] |
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] |
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] |
21846 | Bergson was a rallying point, because he emphasised becomings and multiplicities [Bergson, by Deleuze] |
10173 | A nominalist might avoid abstract objects by just appealing to mereological sums [Reck/Price] |
21854 | Bergson showed that memory is not after the event, but coexists with it [Bergson, by Deleuze] |