38 ideas
| 10476 | The idea that groups of concepts could be 'implicitly defined' was abandoned [Hodges,W] |
| 17926 | Rejecting double negation elimination undermines reductio proofs [Colyvan] |
| 17925 | Showing a disproof is impossible is not a proof, so don't eliminate double negation [Colyvan] |
| 10282 | Logic is the study of sound argument, or of certain artificial languages (or applying the latter to the former) [Hodges,W] |
| 10247 | We have no adequate logic at the moment, so mathematicians must create one [Veblen] |
| 10478 | Since first-order languages are complete, |= and |- have the same meaning [Hodges,W] |
| 10477 | |= in model-theory means 'logical consequence' - it holds in all models [Hodges,W] |
| 17924 | Excluded middle says P or not-P; bivalence says P is either true or false [Colyvan] |
| 10283 | A formula needs an 'interpretation' of its constants, and a 'valuation' of its variables [Hodges,W] |
| 10284 | There are three different standard presentations of semantics [Hodges,W] |
| 10285 | I |= φ means that the formula φ is true in the interpretation I [Hodges,W] |
| 10474 | |= should be read as 'is a model for' or 'satisfies' [Hodges,W] |
| 10473 | Model theory studies formal or natural language-interpretation using set-theory [Hodges,W] |
| 10475 | A 'structure' is an interpretation specifying objects and classes of quantification [Hodges,W] |
| 10481 | Models in model theory are structures, not sets of descriptions [Hodges,W] |
| 10288 | Down Löwenheim-Skolem: if a countable language has a consistent theory, that has a countable model [Hodges,W] |
| 10289 | Up Löwenheim-Skolem: if infinite models, then arbitrarily large models [Hodges,W] |
| 17929 | Löwenheim proved his result for a first-order sentence, and Skolem generalised it [Colyvan] |
| 17930 | Axioms are 'categorical' if all of their models are isomorphic [Colyvan] |
| 10287 | If a first-order theory entails a sentence, there is a finite subset of the theory which entails it [Hodges,W] |
| 17928 | Ordinal numbers represent order relations [Colyvan] |
| 17923 | Intuitionists only accept a few safe infinities [Colyvan] |
| 10480 | First-order logic can't discriminate between one infinite cardinal and another [Hodges,W] |
| 17941 | Infinitesimals were sometimes zero, and sometimes close to zero [Colyvan] |
| 17922 | Reducing real numbers to rationals suggested arithmetic as the foundation of maths [Colyvan] |
| 17936 | Transfinite induction moves from all cases, up to the limit ordinal [Colyvan] |
| 10286 | A 'set' is a mathematically well-behaved class [Hodges,W] |
| 17940 | Most mathematical proofs are using set theory, but without saying so [Colyvan] |
| 17931 | Structuralism say only 'up to isomorphism' matters because that is all there is to it [Colyvan] |
| 17932 | If 'in re' structures relies on the world, does the world contain rich enough structures? [Colyvan] |
| 17943 | Probability supports Bayesianism better as degrees of belief than as ratios of frequencies [Colyvan] |
| 17939 | Mathematics can reveal structural similarities in diverse systems [Colyvan] |
| 17938 | Mathematics can show why some surprising events have to occur [Colyvan] |
| 17934 | Proof by cases (by 'exhaustion') is said to be unexplanatory [Colyvan] |
| 17933 | Reductio proofs do not seem to be very explanatory [Colyvan] |
| 17935 | If inductive proofs hold because of the structure of natural numbers, they may explain theorems [Colyvan] |
| 17942 | Can a proof that no one understands (of the four-colour theorem) really be a proof? [Colyvan] |
| 17937 | Mathematical generalisation is by extending a system, or by abstracting away from it [Colyvan] |