27 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] |
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] |
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] |
14352 | '¬', '&', and 'v' are truth functions: the truth of the compound is fixed by the truth of the components [Jackson] |
13487 | In ZF, the Burali-Forti Paradox proves that there is no set of all ordinals [Zermelo, by Hart,WD] |
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] |
13768 | Validity can preserve certainty in mathematics, but conditionals about contingents are another matter [Edgington] |
14360 | Possible worlds for subjunctives (and dispositions), and no-truth for indicatives? [Jackson] |
13770 | There are many different conditional mental states, and different conditional speech acts [Edgington] |
14353 | Modus ponens requires that A→B is F when A is T and B is F [Jackson] |
14354 | When A and B have the same truth value, A→B is true, because A→A is a logical truth [Jackson] |
14355 | (A&B)→A is a logical truth, even if antecedent false and consequent true, so it is T if A is F and B is T [Jackson] |
13764 | Are conditionals truth-functional - do the truth values of A and B determine the truth value of 'If A, B'? [Edgington] |
13765 | 'If A,B' must entail ¬(A & ¬B); otherwise we could have A true, B false, and If A,B true, invalidating modus ponens [Edgington] |
14358 | In the possible worlds account of conditionals, modus ponens and modus tollens are validated [Jackson] |
14359 | Only assertions have truth-values, and conditionals are not proper assertions [Jackson] |
14357 | Possible worlds account, unlike A⊃B, says nothing about when A is false [Jackson] |
14356 | We can't insist that A is relevant to B, as conditionals can express lack of relevance [Jackson] |