35 ideas
13520 | A 'tautology' must include connectives [Wolf,RS] |
13524 | Deduction Theorem: T∪{P}|-Q, then T|-(P→Q), which justifies Conditional Proof [Wolf,RS] |
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] |
10702 | Set theory's three roles: taming the infinite, subject-matter of mathematics, and modes of reasoning [Potter] |
10713 | Usually the only reason given for accepting the empty set is convenience [Potter] |
13529 | Empty Set: ∃x∀y ¬(y∈x). The unique empty set exists [Wolf,RS] |
13044 | Infinity: There is at least one limit level [Potter] |
13526 | Comprehension Axiom: if a collection is clearly specified, it is a set [Wolf,RS] |
10708 | Nowadays we derive our conception of collections from the dependence between them [Potter] |
13546 | The 'limitation of size' principles say whether properties collectivise depends on the number of objects [Potter] |
10707 | Mereology elides the distinction between the cards in a pack and the suits [Potter] |
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] |
10704 | We can formalize second-order formation rules, but not inference rules [Potter] |
10703 | Supposing axioms (rather than accepting them) give truths, but they are conditional [Potter] |
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] |
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] |
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] |
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] |
10712 | If set theory didn't found mathematics, it is still needed to count infinite sets [Potter] |
17882 | It is remarkable that all natural number arithmetic derives from just the Peano Axioms [Potter] |
13518 | Modern mathematics has unified all of its objects within set theory [Wolf,RS] |
13043 | A relation is a set consisting entirely of ordered pairs [Potter] |
13042 | If dependence is well-founded, with no infinite backward chains, this implies substances [Potter] |
13041 | Collections have fixed members, but fusions can be carved in innumerable ways [Potter] |
10709 | Priority is a modality, arising from collections and members [Potter] |
1748 | Archelaus was the first person to say that the universe is boundless [Archelaus, by Diog. Laertius] |
5989 | Archelaus said life began in a primeval slime [Archelaus, by Schofield] |