38 ideas
| 15924 | Predicative definitions are acceptable in mathematics if they distinguish objects, rather than creating them? [Zermelo, by Lavine] |
| 17608 | We take set theory as given, and retain everything valuable, while avoiding contradictions [Zermelo] |
| 17607 | Set theory investigates number, order and function, showing logical foundations for mathematics [Zermelo] |
| 10870 | ZFC: Existence, Extension, Specification, Pairing, Unions, Powers, Infinity, Choice [Zermelo, by Clegg] |
| 13012 | Zermelo published his axioms in 1908, to secure a controversial proof [Zermelo, by Maddy] |
| 17609 | Set theory can be reduced to a few definitions and seven independent axioms [Zermelo] |
| 9565 | Zermelo made 'set' and 'member' undefined axioms [Zermelo, by Chihara] |
| 3339 | For Zermelo's set theory the empty set is zero and the successor of each number is its unit set [Zermelo, by Blackburn] |
| 17832 | Zermelo showed that the ZF axioms in 1930 were non-categorical [Zermelo, by Hallett,M] |
| 13017 | Zermelo introduced Pairing in 1930, and it seems fairly obvious [Zermelo, by Maddy] |
| 13028 | Replacement was added when some advanced theorems seemed to need it [Zermelo, by Maddy] |
| 13015 | Zermelo used Foundation to block paradox, but then decided that only Separation was needed [Zermelo, by Maddy] |
| 10775 | The axiom of choice now seems acceptable and obvious (if it is meaningful) [Tharp] |
| 13020 | The Axiom of Separation requires set generation up to one step back from contradiction [Zermelo, by Maddy] |
| 13486 | Not every predicate has an extension, but Separation picks the members that satisfy a predicate [Zermelo, by Hart,WD] |
| 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] |
| 18779 | 'The' is a quantifier, like 'every' and 'a', and does not result in denotation [Montague] |
| 10776 | The main quantifiers extend 'and' and 'or' to infinite domains [Tharp] |
| 10774 | There are at least five unorthodox quantifiers that could be used [Tharp] |
| 10777 | Skolem mistakenly inferred that Cantor's conceptions were illusory [Tharp] |
| 10773 | The Löwenheim-Skolem property is a limitation (e.g. can't say there are uncountably many reals) [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] |
| 17626 | The antinomy of endless advance and of completion is resolved in well-ordered transfinite numbers [Zermelo] |
| 13487 | In ZF, the Burali-Forti Paradox proves that there is no set of all ordinals [Zermelo, by Hart,WD] |
| 15897 | Zermelo realised that Choice would facilitate the sort of 'counting' Cantor needed [Zermelo, by Lavine] |
| 18178 | For Zermelo the successor of n is {n} (rather than n U {n}) [Zermelo, by Maddy] |
| 13027 | Zermelo believed, and Von Neumann seemed to confirm, that numbers are sets [Zermelo, by Maddy] |
| 9627 | Different versions of set theory result in different underlying structures for numbers [Zermelo, by Brown,JR] |
| 17613 | We should judge principles by the science, not science by some fixed principles [Zermelo] |