46 ideas
7454 | Gassendi is the first great empiricist philosopher [Hacking] |
13838 | A decent modern definition should always imply a semantics [Hacking] |
13833 | 'Thinning' ('dilution') is the key difference between deduction (which allows it) and induction [Hacking] |
13834 | Gentzen's Cut Rule (or transitivity of deduction) is 'If A |- B and B |- C, then A |- C' [Hacking] |
13835 | Only Cut reduces complexity, so logic is constructive without it, and it can be dispensed with [Hacking] |
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] |
13845 | The various logics are abstractions made from terms like 'if...then' in English [Hacking] |
13840 | First-order logic is the strongest complete compact theory with Löwenheim-Skolem [Hacking] |
13844 | A limitation of first-order logic is that it cannot handle branching quantifiers [Hacking] |
13842 | Second-order completeness seems to need intensional entities and possible worlds [Hacking] |
17924 | Excluded middle says P or not-P; bivalence says P is either true or false [Colyvan] |
13837 | With a pure notion of truth and consequence, the meanings of connectives are fixed syntactically [Hacking] |
13839 | Perhaps variables could be dispensed with, by arrows joining places in the scope of quantifiers [Hacking] |
13843 | If it is a logic, the Löwenheim-Skolem theorem holds for it [Hacking] |
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] |
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] |
7447 | Probability was fully explained between 1654 and 1812 [Hacking] |
7448 | Probability is statistical (behaviour of chance devices) or epistemological (belief based on evidence) [Hacking] |
7449 | Epistemological probability based either on logical implications or coherent judgments [Hacking] |
19542 | It is nonsense that understanding does not involve knowledge; to understand, you must know [Dougherty/Rysiew] |
19543 | To grasp understanding, we should be more explicit about what needs to be known [Dougherty/Rysiew] |
19541 | Rather than knowledge, our epistemic aim may be mere true belief, or else understanding and wisdom [Dougherty/Rysiew] |
19540 | Don't confuse justified belief with justified believers [Dougherty/Rysiew] |
19539 | If knowledge is unanalysable, that makes justification more important [Dougherty/Rysiew] |
7450 | In the medieval view, only deduction counted as true evidence [Hacking] |
7451 | Formerly evidence came from people; the new idea was that things provided evidence [Hacking] |
7452 | An experiment is a test, or an adventure, or a diagnosis, or a dissection [Hacking, by PG] |
17943 | Probability supports Bayesianism better as degrees of belief than as ratios of frequencies [Colyvan] |
7459 | Follow maths for necessary truths, and jurisprudence for contingent truths [Hacking] |
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] |
19538 | Entailment is modelled in formal semantics as set inclusion (where 'mammals' contains 'cats') [Dougherty/Rysiew] |