74 ideas
| 17774 | Definitions make our intuitions mathematically useful [Mayberry] |
| 9955 | Contextual definitions replace a complete sentence containing the expression [George/Velleman] |
| 10031 | Impredicative definitions quantify over the thing being defined [George/Velleman] |
| 17773 | Proof shows that it is true, but also why it must be true [Mayberry] |
| 10098 | The 'power set' of A is all the subsets of A [George/Velleman] |
| 10101 |
Cartesian Product A x B: the set of all ordered pairs |
| 10099 | The 'ordered pair' <a, b>, for two sets a and b, is the set {{a, b},{a}} [George/Velleman] |
| 10103 | Grouping by property is common in mathematics, usually using equivalence [George/Velleman] |
| 10104 | 'Equivalence' is a reflexive, symmetric and transitive relation; 'same first letter' partitions English words [George/Velleman] |
| 17796 | There is a semi-categorical axiomatisation of set-theory [Mayberry] |
| 17795 | Set theory can't be axiomatic, because it is needed to express the very notion of axiomatisation [Mayberry] |
| 10096 | Even the elements of sets in ZFC are sets, resting on the pure empty set [George/Velleman] |
| 10097 | Axiom of Extensionality: for all sets x and y, if x and y have the same elements then x = y [George/Velleman] |
| 10100 | Axiom of Pairing: for all sets x and y, there is a set z containing just x and y [George/Velleman] |
| 17800 | The misnamed Axiom of Infinity says the natural numbers are finite in size [Mayberry] |
| 17900 | The Axiom of Reducibility made impredicative definitions possible [George/Velleman] |
| 10109 | ZFC can prove that there is no set corresponding to the concept 'set' [George/Velleman] |
| 17801 | The set hierarchy doesn't rely on the dubious notion of 'generating' them [Mayberry] |
| 17803 | Limitation of size is part of the very conception of a set [Mayberry] |
| 10108 | As a reduction of arithmetic, set theory is not fully general, and so not logical [George/Velleman] |
| 17786 | The mainstream of modern logic sees it as a branch of mathematics [Mayberry] |
| 17788 | First-order logic only has its main theorems because it is so weak [Mayberry] |
| 17791 | Only second-order logic can capture mathematical structure up to isomorphism [Mayberry] |
| 10111 | Asserting Excluded Middle is a hallmark of realism about the natural world [George/Velleman] |
| 17787 | Big logic has one fixed domain, but standard logic has a domain for each interpretation [Mayberry] |
| 10129 | A 'model' is a meaning-assignment which makes all the axioms true [George/Velleman] |
| 10105 | Differences between isomorphic structures seem unimportant [George/Velleman] |
| 17790 | No Löwenheim-Skolem logic can axiomatise real analysis [Mayberry] |
| 17779 | 'Classificatory' axioms aim at revealing similarity in morphology of structures [Mayberry] |
| 17778 | Axiomatiation relies on isomorphic structures being essentially the same [Mayberry] |
| 17780 | 'Eliminatory' axioms get rid of traditional ideal and abstract objects [Mayberry] |
| 10119 | Consistency is a purely syntactic property, unlike the semantic property of soundness [George/Velleman] |
| 10126 | A 'consistent' theory cannot contain both a sentence and its negation [George/Velleman] |
| 10120 | Soundness is a semantic property, unlike the purely syntactic property of consistency [George/Velleman] |
| 10127 | A 'complete' theory contains either any sentence or its negation [George/Velleman] |
| 17789 | No logic which can axiomatise arithmetic can be compact or complete [Mayberry] |
| 10106 | Rational numbers give answers to division problems with integers [George/Velleman] |
| 10102 | The integers are answers to subtraction problems involving natural numbers [George/Velleman] |
| 17784 | Real numbers can be eliminated, by axiom systems for complete ordered fields [Mayberry] |
| 10107 | Real numbers provide answers to square root problems [George/Velleman] |
| 17782 | Greek quantities were concrete, and ratio and proportion were their science [Mayberry] |
| 17781 | Real numbers were invented, as objects, to simplify and generalise 'quantity' [Mayberry] |
| 9946 | Logicists say mathematics is applicable because it is totally general [George/Velleman] |
| 17799 | Cantor's infinite is an absolute, of all the sets or all the ordinal numbers [Mayberry] |
| 17797 | Cantor extended the finite (rather than 'taming the infinite') [Mayberry] |
| 10125 | The classical mathematician believes the real numbers form an actual set [George/Velleman] |
| 17775 | If proof and definition are central, then mathematics needs and possesses foundations [Mayberry] |
| 17776 | The ultimate principles and concepts of mathematics are presumed, or grasped directly [Mayberry] |
| 17777 | Foundations need concepts, definition rules, premises, and proof rules [Mayberry] |
| 17804 | Axiom theories can't give foundations for mathematics - that's using axioms to explain axioms [Mayberry] |
| 17792 | 1st-order PA is only interesting because of results which use 2nd-order PA [Mayberry] |
| 17899 | Second-order induction is stronger as it covers all concepts, not just first-order definable ones [George/Velleman] |
| 17793 | It is only 2nd-order isomorphism which suggested first-order PA completeness [Mayberry] |
| 10128 | The Incompleteness proofs use arithmetic to talk about formal arithmetic [George/Velleman] |
| 17902 | A successor is the union of a set with its singleton [George/Velleman] |
| 10133 | Frege's Theorem shows the Peano Postulates can be derived from Hume's Principle [George/Velleman] |
| 17794 | Set theory is not just first-order ZF, because that is inadequate for mathematics [Mayberry] |
| 17802 | We don't translate mathematics into set theory, because it comes embodied in that way [Mayberry] |
| 17805 | Set theory is not just another axiomatised part of mathematics [Mayberry] |
| 10130 | Set theory can prove the Peano Postulates [George/Velleman] |
| 10089 | Talk of 'abstract entities' is more a label for the problem than a solution to it [George/Velleman] |
| 10131 | If mathematics is not about particulars, observing particulars must be irrelevant [George/Velleman] |
| 10092 | In the unramified theory of types, the types are objects, then sets of objects, sets of sets etc. [George/Velleman] |
| 10094 | The theory of types seems to rule out harmless sets as well as paradoxical ones. [George/Velleman] |
| 10095 | Type theory has only finitely many items at each level, which is a problem for mathematics [George/Velleman] |
| 17901 | Type theory prohibits (oddly) a set containing an individual and a set of individuals [George/Velleman] |
| 10114 | Bounded quantification is originally finitary, as conjunctions and disjunctions [George/Velleman] |
| 10134 | Much infinite mathematics can still be justified finitely [George/Velleman] |
| 10123 | The intuitionists are the idealists of mathematics [George/Velleman] |
| 10124 | Gödel's First Theorem suggests there are truths which are independent of proof [George/Velleman] |
| 17785 | Real numbers as abstracted objects are now treated as complete ordered fields [Mayberry] |
| 8840 | There are five possible responses to the problem of infinite regress in justification [Cleve] |
| 8841 | Modern foundationalists say basic beliefs are fallible, and coherence is relevant [Cleve] |
| 10110 | Corresponding to every concept there is a class (some of them sets) [George/Velleman] |