41 ideas
2572 | Logical truth seems much less likely to 'correspond to the facts' than factual truth does [Haack] |
2570 | The same sentence could be true in one language and meaningless in another, so truth is language-relative [Haack] |
10170 | While true-in-a-model seems relative, true-in-all-models seems not to be [Reck/Price] |
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] |
10166 | ZFC set theory has only 'pure' sets, without 'urelements' [Reck/Price] |
17924 | Excluded middle says P or not-P; bivalence says P is either true or false [Colyvan] |
10175 | Three types of variable in second-order logic, for objects, functions, and predicates/sets [Reck/Price] |
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] |
17928 | Ordinal numbers represent order relations [Colyvan] |
10165 | 'Analysis' is the theory of the real numbers [Reck/Price] |
17923 | Intuitionists only accept a few safe infinities [Colyvan] |
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] |
10174 | Mereological arithmetic needs infinite objects, and function definitions [Reck/Price] |
10164 | Peano Arithmetic can have three second-order axioms, plus '1' and 'successor' [Reck/Price] |
17936 | Transfinite induction moves from all cases, up to the limit ordinal [Colyvan] |
10172 | Set-theory gives a unified and an explicit basis for mathematics [Reck/Price] |
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] |
10167 | Structuralism emerged from abstract algebra, axioms, and set theory and its structures [Reck/Price] |
10169 | Relativist Structuralism just stipulates one successful model as its arithmetic [Reck/Price] |
10179 | There are 'particular' structures, and 'universal' structures (what the former have in common) [Reck/Price] |
10181 | Pattern Structuralism studies what isomorphic arithmetic models have in common [Reck/Price] |
10182 | There are Formalist, Relativist, Universalist and Pattern structuralism [Reck/Price] |
10168 | Formalist Structuralism says the ontology is vacuous, or formal, or inference relations [Reck/Price] |
10178 | Maybe we should talk of an infinity of 'possible' objects, to avoid arithmetic being vacuous [Reck/Price] |
10176 | Universalist Structuralism is based on generalised if-then claims, not one particular model [Reck/Price] |
10177 | Universalist Structuralism eliminates the base element, as a variable, which is then quantified out [Reck/Price] |
10171 | The existence of an infinite set is assumed by Relativist Structuralism [Reck/Price] |
17932 | If 'in re' structures relies on the world, does the world contain rich enough structures? [Colyvan] |
10173 | A nominalist might avoid abstract objects by just appealing to mereological sums [Reck/Price] |
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] |