39 ideas
| 7454 | Gassendi is the first great empiricist philosopher [Hacking] |
| 13838 | A decent modern definition should always imply a semantics [Hacking] |
| 13520 | A 'tautology' must include connectives [Wolf,RS] |
| 13524 | Deduction Theorem: T∪{P}|-Q, then T|-(P→Q), which justifies Conditional Proof [Wolf,RS] |
| 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] |
| 13522 | Universal Generalization: If we prove P(x) with no special assumptions, we can conclude ∀xP(x) [Wolf,RS] |
| 13521 | Universal Specification: ∀xP(x) implies P(t). True for all? Then true for an instance [Wolf,RS] |
| 13523 | Existential Generalization (or 'proof by example'): if we can say P(t), then we can say something is P [Wolf,RS] |
| 13529 | Empty Set: ∃x∀y ¬(y∈x). The unique empty set exists [Wolf,RS] |
| 13526 | Comprehension Axiom: if a collection is clearly specified, it is a set [Wolf,RS] |
| 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] |
| 13534 | In first-order logic syntactic and semantic consequence (|- and |=) nicely coincide [Wolf,RS] |
| 13535 | First-order logic is weakly complete (valid sentences are provable); we can't prove every sentence or its negation [Wolf,RS] |
| 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] |
| 13531 | Model theory reveals the structures of mathematics [Wolf,RS] |
| 13532 | Model theory 'structures' have a 'universe', some 'relations', some 'functions', and some 'constants' [Wolf,RS] |
| 13519 | Model theory uses sets to show that mathematical deduction fits mathematical truth [Wolf,RS] |
| 13533 | First-order model theory rests on completeness, compactness, and the Löwenheim-Skolem-Tarski theorem [Wolf,RS] |
| 13537 | An 'isomorphism' is a bijection that preserves all structural components [Wolf,RS] |
| 13539 | The LST Theorem is a serious limitation of first-order logic [Wolf,RS] |
| 13843 | If it is a logic, the Löwenheim-Skolem theorem holds for it [Hacking] |
| 13538 | If a theory is complete, only a more powerful language can strengthen it [Wolf,RS] |
| 13525 | Most deductive logic (unlike ordinary reasoning) is 'monotonic' - we don't retract after new givens [Wolf,RS] |
| 13530 | An ordinal is an equivalence class of well-orderings, or a transitive set whose members are transitive [Wolf,RS] |
| 13518 | Modern mathematics has unified all of its objects within set theory [Wolf,RS] |
| 12887 | A whole must have one characteristic, an internal relation, and a structure [Rescher/Oppenheim] |
| 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] |