35 ideas
10170 | While true-in-a-model seems relative, true-in-all-models seems not to be [Reck/Price] |
10166 | ZFC set theory has only 'pure' sets, without 'urelements' [Reck/Price] |
10775 | The axiom of choice now seems acceptable and obvious (if it is meaningful) [Tharp] |
10766 | Logic is either for demonstration, or for characterizing structures [Tharp] |
10767 | Elementary logic is complete, but cannot capture mathematics [Tharp] |
10769 | Second-order logic isn't provable, but will express set-theory and classic problems [Tharp] |
10762 | In sentential logic there is a simple proof that all truth functions can be reduced to 'not' and 'and' [Tharp] |
10776 | The main quantifiers extend 'and' and 'or' to infinite domains [Tharp] |
10175 | Three types of variable in second-order logic, for objects, functions, and predicates/sets [Reck/Price] |
10774 | There are at least five unorthodox quantifiers that could be used [Tharp] |
10773 | The Löwenheim-Skolem property is a limitation (e.g. can't say there are uncountably many reals) [Tharp] |
10777 | Skolem mistakenly inferred that Cantor's conceptions were illusory [Tharp] |
10765 | Soundness would seem to be an essential requirement of a proof procedure [Tharp] |
10763 | Completeness and compactness together give axiomatizability [Tharp] |
10770 | If completeness fails there is no algorithm to list the valid formulas [Tharp] |
10771 | Compactness is important for major theories which have infinitely many axioms [Tharp] |
10772 | Compactness blocks infinite expansion, and admits non-standard models [Tharp] |
10764 | A complete logic has an effective enumeration of the valid formulas [Tharp] |
10768 | Effective enumeration might be proved but not specified, so it won't guarantee knowledge [Tharp] |
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] |
10173 | A nominalist might avoid abstract objects by just appealing to mereological sums [Reck/Price] |
20147 | Arguments that my finger does not exist are less certain than your seeing my finger [Moore,GE] |