37 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] |
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] |
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] |
10429 | It is best to say that a name designates iff there is something for it to designate [Sainsbury] |
10425 | Definite descriptions may not be referring expressions, since they can fail to refer [Sainsbury] |
10438 | Definite descriptions are usually rigid in subject, but not in predicate, position [Sainsbury] |
13843 | If it is a logic, the Löwenheim-Skolem theorem holds for it [Hacking] |
8983 | If 'red' is vague, then membership of the set of red things is vague, so there is no set of red things [Sainsbury] |
8986 | We should abandon classifying by pigeon-holes, and classify around paradigms [Sainsbury] |
8982 | Vague concepts are concepts without boundaries [Sainsbury] |
8984 | If concepts are vague, people avoid boundaries, can't spot them, and don't want them [Sainsbury] |
8985 | Boundaryless concepts tend to come in pairs, such as child/adult, hot/cold [Sainsbury] |
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] |
19718 | Indefeasibility does not imply infallibility [Grundmann] |
19717 | Can a defeater itself be defeated? [Grundmann] |
19716 | Simple reliabilism can't cope with defeaters of reliably produced beliefs [Grundmann] |
19715 | You can 'rebut' previous beliefs, 'undercut' the power of evidence, or 'reason-defeat' the truth [Grundmann] |
19713 | Defeasibility theory needs to exclude defeaters which are true but misleading [Grundmann] |
19714 | Knowledge requires that there are no facts which would defeat its justification [Grundmann] |
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] |
19719 | 'Moderate' foundationalism has basic justification which is defeasible [Grundmann] |
7452 | An experiment is a test, or an adventure, or a diagnosis, or a dissection [Hacking, by PG] |
7459 | Follow maths for necessary truths, and jurisprudence for contingent truths [Hacking] |
10432 | A new usage of a name could arise from a mistaken baptism of nothing [Sainsbury] |
10434 | Even a quantifier like 'someone' can be used referentially [Sainsbury] |
10431 | Things are thought to have a function, even when they can't perform them [Sainsbury] |