39 ideas
7454 | Gassendi is the first great empiricist philosopher [Hacking] |
13838 | A decent modern definition should always imply a semantics [Hacking] |
17749 | Post proved the consistency of propositional logic in 1921 [Walicki] |
17765 | Propositional language can only relate statements as the same or as different [Walicki] |
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] |
17764 | Boolean connectives are interpreted as functions on the set {1,0} [Walicki] |
17752 | The empty set is useful for defining sets by properties, when the members are not yet known [Walicki] |
17753 | The empty set avoids having to take special precautions in case members vanish [Walicki] |
17759 | Ordinals play the central role in set theory, providing the model of well-ordering [Walicki] |
17741 | To determine the patterns in logic, one must identify its 'building blocks' [Walicki] |
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] |
17747 | A 'model' of a theory specifies interpreting a language in a domain to make all theorems true [Walicki] |
17748 | The L-S Theorem says no theory (even of reals) says more than a natural number theory [Walicki] |
13843 | If it is a logic, the Löwenheim-Skolem theorem holds for it [Hacking] |
17763 | Axiomatic systems are purely syntactic, and do not presuppose any interpretation [Walicki] |
17761 | A compact axiomatisation makes it possible to understand a field as a whole [Walicki] |
17758 | Ordinals are transitive sets of transitive sets; or transitive sets totally ordered by inclusion [Walicki] |
17755 | Ordinals are the empty set, union with the singleton, and any arbitrary union of ordinals [Walicki] |
17756 | The union of finite ordinals is the first 'limit ordinal'; 2ω is the second... [Walicki] |
17760 | Two infinite ordinals can represent a single infinite cardinal [Walicki] |
17757 | Members of ordinals are ordinals, and also subsets of ordinals [Walicki] |
17762 | In non-Euclidean geometry, all Euclidean theorems are valid that avoid the fifth postulate [Walicki] |
17754 | Inductive proof depends on the choice of the ordering [Walicki] |
17742 | Scotus based modality on semantic consistency, instead of on what the future could allow [Walicki] |
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] |
3029 | Stilpo said if Athena is a daughter of Zeus, then a statue is only the child of a sculptor, and so is not a god [Stilpo, by Diog. Laertius] |