62 ideas
15586 | When philosophy makes itself intelligible, it commits suicide [Heidegger] |
16877 | A 'constructive' (as opposed to 'analytic') definition creates a new sign [Frege] |
9955 | Contextual definitions replace a complete sentence containing the expression [George/Velleman] |
10031 | Impredicative definitions quantify over the thing being defined [George/Velleman] |
11219 | Frege suggested that mathematics should only accept stipulative definitions [Frege, by Gupta] |
16878 | We must be clear about every premise and every law used in a proof [Frege] |
10098 | The 'power set' of A is all the subsets of A [George/Velleman] |
10099 | The 'ordered pair' <a, b>, for two sets a and b, is the set {{a, b},{a}} [George/Velleman] |
10101 | Cartesian Product A x B: the set of all ordered pairs in which a∈A and b∈B [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] |
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] |
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] |
10108 | As a reduction of arithmetic, set theory is not fully general, and so not logical [George/Velleman] |
16867 | Logic not only proves things, but also reveals logical relations between them [Frege] |
16863 | Does some mathematical reasoning (such as mathematical induction) not belong to logic? [Frege] |
16862 | The closest subject to logic is mathematics, which does little apart from drawing inferences [Frege] |
10111 | Asserting Excluded Middle is a hallmark of realism about the natural world [George/Velleman] |
16865 | 'Theorems' are both proved, and used in proofs [Frege] |
10129 | A 'model' is a meaning-assignment which makes all the axioms true [George/Velleman] |
10105 | Differences between isomorphic structures seem unimportant [George/Velleman] |
16866 | Tracing inference backwards closes in on a small set of axioms and postulates [Frege] |
16868 | The essence of mathematics is the kernel of primitive truths on which it rests [Frege] |
16871 | A truth can be an axiom in one system and not in another [Frege] |
16870 | Axioms are truths which cannot be doubted, and for which no proof is needed [Frege] |
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] |
16869 | To create order in mathematics we need a full system, guided by patterns of inference [Frege] |
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] |
10107 | Real numbers provide answers to square root problems [George/Velleman] |
9946 | Logicists say mathematics is applicable because it is totally general [George/Velleman] |
10125 | The classical mathematician believes the real numbers form an actual set [George/Velleman] |
16864 | If principles are provable, they are theorems; if not, they are axioms [Frege] |
17899 | Second-order induction is stronger as it covers all concepts, not just first-order definable ones [George/Velleman] |
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] |
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] |
9388 | Every concept must have a sharp boundary; we cannot allow an indeterminate third case [Frege] |
16876 | We need definitions to cram retrievable sense into a signed receptacle [Frege] |
16875 | We use signs to mark receptacles for complex senses [Frege] |
10110 | Corresponding to every concept there is a class (some of them sets) [George/Velleman] |
16879 | A sign won't gain sense just from being used in sentences with familiar components [Frege] |
16873 | Thoughts are not subjective or psychological, because some thoughts are the same for us all [Frege] |
16872 | A thought is the sense expressed by a sentence, and is what we prove [Frege] |
16874 | The parts of a thought map onto the parts of a sentence [Frege] |