36 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] |
| 10888 | Sets can be defined by 'enumeration', or by 'abstraction' (based on a property) [Zalabardo] |
| 10889 | The 'Cartesian Product' of two sets relates them by pairing every element with every element [Zalabardo] |
| 10890 | A 'partial ordering' is reflexive, antisymmetric and transitive [Zalabardo] |
| 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] |
| 10886 | Determinacy: an object is either in a set, or it isn't [Zalabardo] |
| 13017 | Zermelo introduced Pairing in 1930, and it seems fairly obvious [Zermelo, by Maddy] |
| 13015 | Zermelo used Foundation to block paradox, but then decided that only Separation was needed [Zermelo, by Maddy] |
| 10887 | Specification: Determinate totals of objects always make a set [Zalabardo] |
| 13486 | Not every predicate has an extension, but Separation picks the members that satisfy a predicate [Zermelo, by Hart,WD] |
| 13020 | The Axiom of Separation requires set generation up to one step back from contradiction [Zermelo, by Maddy] |
| 10897 | A first-order 'sentence' is a formula with no free variables [Zalabardo] |
| 10893 | Γ |= φ for sentences if φ is true when all of Γ is true [Zalabardo] |
| 10899 | Γ |= φ if φ is true when all of Γ is true, for all structures and interpretations [Zalabardo] |
| 10896 | Propositional logic just needs ¬, and one of ∧, ∨ and → [Zalabardo] |
| 10898 | The semantics shows how truth values depend on instantiations of properties and relations [Zalabardo] |
| 10902 | We can do semantics by looking at given propositions, or by building new ones [Zalabardo] |
| 10892 | We make a truth assignment to T and F, which may be true and false, but merely differ from one another [Zalabardo] |
| 10895 | 'Logically true' (|= φ) is true for every truth-assignment [Zalabardo] |
| 10900 | Logically true sentences are true in all structures [Zalabardo] |
| 10894 | A sentence-set is 'satisfiable' if at least one truth-assignment makes them all true [Zalabardo] |
| 10901 | Some formulas are 'satisfiable' if there is a structure and interpretation that makes them true [Zalabardo] |
| 10903 | A structure models a sentence if it is true in the model, and a set of sentences if they are all true in the model [Zalabardo] |
| 13487 | In ZF, the Burali-Forti Paradox proves that there is no set of all ordinals [Zermelo, by Hart,WD] |
| 10891 | If a set is defined by induction, then proof by induction can be applied to it [Zalabardo] |
| 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] |
| 22049 | Transcendental idealism aims to explain objectivity through subjectivity [Bowie] |
| 22055 | The Idealists saw the same unexplained spontaneity in Kant's judgements and choices [Bowie] |
| 22054 | German Idealism tried to stop oppositions of appearances/things and receptivity/spontaneity [Bowie] |
| 22056 | Crucial to Idealism is the idea of continuity between receptivity and spontaneous judgement [Bowie] |