35 ideas
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] |
10147 | The Axiom of Choice is consistent with the other axioms of set theory [Feferman/Feferman] |
10148 | Axiom of Choice: a set exists which chooses just one element each of any set of sets [Feferman/Feferman] |
10149 | Platonist will accept the Axiom of Choice, but others want criteria of selection or definition [Feferman/Feferman] |
10150 | The Trichotomy Principle is equivalent to the Axiom of Choice [Feferman/Feferman] |
10146 | Cantor's theories needed the Axiom of Choice, but it has led to great controversy [Feferman/Feferman] |
17924 | Excluded middle says P or not-P; bivalence says P is either true or false [Colyvan] |
10158 | A structure is a 'model' when the axioms are true. So which of the structures are models? [Feferman/Feferman] |
10162 | Tarski and Vaught established the equivalence relations between first-order structures [Feferman/Feferman] |
10160 | Löwenheim-Skolem says if the sentences are countable, so is the model [Feferman/Feferman] |
10159 | Löwenheim-Skolem Theorem, and Gödel's completeness of first-order logic, the earliest model theory [Feferman/Feferman] |
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] |
10161 | If a sentence holds in every model of a theory, then it is logically derivable from the theory [Feferman/Feferman] |
10156 | 'Recursion theory' concerns what can be solved by computing machines [Feferman/Feferman] |
10155 | Both Principia Mathematica and Peano Arithmetic are undecidable [Feferman/Feferman] |
17928 | Ordinal numbers represent order relations [Colyvan] |
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] |
17936 | Transfinite induction moves from all cases, up to the limit ordinal [Colyvan] |
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] |
14082 | No sortal could ever exactly pin down which set of particles count as this 'cup' [Schaffer,J] |
14081 | Identities can be true despite indeterminate reference, if true under all interpretations [Schaffer,J] |
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] |