41 ideas
| 15924 | Predicative definitions are acceptable in mathematics if they distinguish objects, rather than creating them? [Zermelo, by Lavine] |
| 13520 | A 'tautology' must include connectives [Wolf,RS] |
| 13524 | Deduction Theorem: T∪{P}|-Q, then T|-(P→Q), which justifies Conditional Proof [Wolf,RS] |
| 13522 | Universal Generalization: If we prove P(x) with no special assumptions, we can conclude ∀xP(x) [Wolf,RS] |
| 13521 | Universal Specification: ∀xP(x) implies P(t). True for all? Then true for an instance [Wolf,RS] |
| 13523 | Existential Generalization (or 'proof by example'): if we can say P(t), then we can say something is P [Wolf,RS] |
| 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] |
| 13529 | Empty Set: ∃x∀y ¬(y∈x). The unique empty set exists [Wolf,RS] |
| 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] |
| 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] |
| 13526 | Comprehension Axiom: if a collection is clearly specified, it is a set [Wolf,RS] |
| 13534 | In first-order logic syntactic and semantic consequence (|- and |=) nicely coincide [Wolf,RS] |
| 13535 | First-order logic is weakly complete (valid sentences are provable); we can't prove every sentence or its negation [Wolf,RS] |
| 13531 | Model theory reveals the structures of mathematics [Wolf,RS] |
| 13532 | Model theory 'structures' have a 'universe', some 'relations', some 'functions', and some 'constants' [Wolf,RS] |
| 13519 | Model theory uses sets to show that mathematical deduction fits mathematical truth [Wolf,RS] |
| 13533 | First-order model theory rests on completeness, compactness, and the Löwenheim-Skolem-Tarski theorem [Wolf,RS] |
| 13537 | An 'isomorphism' is a bijection that preserves all structural components [Wolf,RS] |
| 13539 | The LST Theorem is a serious limitation of first-order logic [Wolf,RS] |
| 13538 | If a theory is complete, only a more powerful language can strengthen it [Wolf,RS] |
| 13525 | Most deductive logic (unlike ordinary reasoning) is 'monotonic' - we don't retract after new givens [Wolf,RS] |
| 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] |
| 13530 | An ordinal is an equivalence class of well-orderings, or a transitive set whose members are transitive [Wolf,RS] |
| 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] |
| 13518 | Modern mathematics has unified all of its objects within set theory [Wolf,RS] |
| 9627 | Different versions of set theory result in different underlying structures for numbers [Zermelo, by Brown,JR] |
| 12887 | A whole must have one characteristic, an internal relation, and a structure [Rescher/Oppenheim] |
| 17613 | We should judge principles by the science, not science by some fixed principles [Zermelo] |