30 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] |
10751 | Second-order logic needs the sets, and its consequence has epistemological problems [Rossberg] |
10757 | Henkin semantics has a second domain of predicates and relations (in upper case) [Rossberg] |
10759 | There are at least seven possible systems of semantics for second-order logic [Rossberg] |
10753 | Logical consequence is intuitively semantic, and captured by model theory [Rossberg] |
10752 | Γ |- S says S can be deduced from Γ; Γ |= S says a good model for Γ makes S true [Rossberg] |
10754 | In proof-theory, logical form is shown by the logical constants [Rossberg] |
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] |
10756 | A model is a domain, and an interpretation assigning objects, predicates, relations etc. [Rossberg] |
10758 | If models of a mathematical theory are all isomorphic, it is 'categorical', with essentially one model [Rossberg] |
13843 | If it is a logic, the Löwenheim-Skolem theorem holds for it [Hacking] |
10761 | Completeness can always be achieved by cunning model-design [Rossberg] |
10755 | A deductive system is only incomplete with respect to a formal semantics [Rossberg] |
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] |
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] |
7459 | Follow maths for necessary truths, and jurisprudence for contingent truths [Hacking] |
20653 | Six reduction levels: groups, lives, cells, molecules, atoms, particles [Putnam/Oppenheim, by Watson] |