84 ideas
| 9955 | Contextual definitions replace a complete sentence containing the expression [George/Velleman] |
| 10031 | Impredicative definitions quantify over the thing being defined [George/Velleman] |
| 10987 | Three traditional names of rules are 'Simplification', 'Addition' and 'Disjunctive Syllogism' [Read] |
| 11004 | Necessity is provability in S4, and true in all worlds in S5 [Read] |
| 11018 | There are fuzzy predicates (and sets), and fuzzy quantifiers and modifiers [Read] |
| 11011 | Same say there are positive, negative and neuter free logics [Read] |
| 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] |
| 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] |
| 11020 | Realisms like the full Comprehension Principle, that all good concepts determine sets [Read] |
| 10108 | As a reduction of arithmetic, set theory is not fully general, and so not logical [George/Velleman] |
| 10986 | Not all validity is captured in first-order logic [Read] |
| 10972 | The non-emptiness of the domain is characteristic of classical logic [Read] |
| 11024 | Semantics must precede proof in higher-order logics, since they are incomplete [Read] |
| 10985 | We should exclude second-order logic, precisely because it captures arithmetic [Read] |
| 10970 | A theory of logical consequence is a conceptual analysis, and a set of validity techniques [Read] |
| 10984 | Logical consequence isn't just a matter of form; it depends on connections like round-square [Read] |
| 10111 | Asserting Excluded Middle is a hallmark of realism about the natural world [George/Velleman] |
| 10973 | A theory is logically closed, which means infinite premisses [Read] |
| 11007 | Quantifiers are second-order predicates [Read] |
| 10978 | In second-order logic the higher-order variables range over all the properties of the objects [Read] |
| 10971 | A logical truth is the conclusion of a valid inference with no premisses [Read] |
| 10129 | A 'model' is a meaning-assignment which makes all the axioms true [George/Velleman] |
| 10105 | Differences between isomorphic structures seem unimportant [George/Velleman] |
| 10988 | Any first-order theory of sets is inadequate [Read] |
| 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] |
| 10975 | Compactness does not deny that an inference can have infinitely many premisses [Read] |
| 10974 | Compactness is when any consequence of infinite propositions is the consequence of a finite subset [Read] |
| 10977 | Compactness blocks the proof of 'for every n, A(n)' (as the proof would be infinite) [Read] |
| 10976 | Compactness makes consequence manageable, but restricts expressive power [Read] |
| 11014 | Self-reference paradoxes seem to arise only when falsity is involved [Read] |
| 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] |
| 11025 | Infinite cuts and successors seems to suggest an actual infinity there waiting for us [Read] |
| 10125 | The classical mathematician believes the real numbers form an actual set [George/Velleman] |
| 10979 | Although second-order arithmetic is incomplete, it can fully model normal arithmetic [Read] |
| 10980 | Second-order arithmetic covers all properties, ensuring categoricity [Read] |
| 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] |
| 10997 | Von Neumann numbers are helpful, but don't correctly describe numbers [Read] |
| 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] |
| 11016 | Would a language without vagueness be usable at all? [Read] |
| 11019 | Supervaluations say there is a cut-off somewhere, but at no particular place [Read] |
| 11012 | A 'supervaluation' gives a proposition consistent truth-value for classical assignments [Read] |
| 11013 | Identities and the Indiscernibility of Identicals don't work with supervaluations [Read] |
| 10995 | A haecceity is a set of individual properties, essential to each thing [Read] |
| 11001 | Equating necessity with truth in every possible world is the S5 conception of necessity [Read] |
| 10989 | The standard view of conditionals is that they are truth-functional [Read] |
| 10992 | The point of conditionals is to show that one will accept modus ponens [Read] |
| 11017 | Some people even claim that conditionals do not express propositions [Read] |
| 10983 | Knowledge of possible worlds is not causal, but is an ontology entailed by semantics [Read] |
| 10982 | How can modal Platonists know the truth of a modal proposition? [Read] |
| 10996 | Actualism is reductionist (to parts of actuality), or moderate realist (accepting real abstractions) [Read] |
| 10981 | A possible world is a determination of the truth-values of all propositions of a domain [Read] |
| 11000 | If worlds are concrete, objects can't be present in more than one, and can only have counterparts [Read] |
| 8417 | Direct realism is false, because defeasibility questions are essential to perceptual knowledge [Galloway] |
| 10998 | The mind abstracts ways things might be, which are nonetheless real [Read] |
| 10110 | Corresponding to every concept there is a class (some of them sets) [George/Velleman] |
| 11005 | Negative existentials with compositionality make the whole sentence meaningless [Read] |
| 10966 | A proposition objectifies what a sentence says, as indicative, with secure references [Read] |