40 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] |
13521 | Universal Specification: ∀xP(x) implies P(t). True for all? Then true for an instance [Wolf,RS] |
13522 | Universal Generalization: If we prove P(x) with no special assumptions, we can conclude ∀xP(x) [Wolf,RS] |
13523 | Existential Generalization (or 'proof by example'): if we can say P(t), then we can say something is P [Wolf,RS] |
10859 | A set is 'well-ordered' if every subset has a first element [Clegg] |
10857 | Set theory made a closer study of infinity possible [Clegg] |
10864 | Any set can always generate a larger set - its powerset, of subsets [Clegg] |
10872 | Extensionality: Two sets are equal if and only if they have the same elements [Clegg] |
10875 | Pairing: For any two sets there exists a set to which they both belong [Clegg] |
10876 | Unions: There is a set of all the elements which belong to at least one set in a collection [Clegg] |
13529 | Empty Set: ∃x∀y ¬(y∈x). The unique empty set exists [Wolf,RS] |
10878 | Infinity: There exists a set of the empty set and the successor of each element [Clegg] |
10877 | Powers: All the subsets of a given set form their own new powerset [Clegg] |
10879 | Choice: For every set a mechanism will choose one member of any non-empty subset [Clegg] |
10871 | Axiom of Existence: there exists at least one set [Clegg] |
10874 | Specification: a condition applied to a set will always produce a new set [Clegg] |
13526 | Comprehension Axiom: if a collection is clearly specified, it is a set [Wolf,RS] |
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] |
13519 | Model theory uses sets to show that mathematical deduction fits mathematical truth [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] |
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] |
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] |
10880 | Mathematics can be 'pure' (unapplied), 'real' (physically grounded); or 'applied' (just applicable) [Clegg] |
10860 | An ordinal number is defined by the set that comes before it [Clegg] |
10861 | Beyond infinity cardinals and ordinals can come apart [Clegg] |
13530 | An ordinal is an equivalence class of well-orderings, or a transitive set whose members are transitive [Wolf,RS] |
10854 | Transcendental numbers can't be fitted to finite equations [Clegg] |
10858 | By adding an axis of imaginary numbers, we get the useful 'number plane' instead of number line [Clegg] |
10853 | Either lack of zero made early mathematics geometrical, or the geometrical approach made zero meaningless [Clegg] |
10866 | Cantor's account of infinities has the shaky foundation of irrational numbers [Clegg] |
10869 | The Continuum Hypothesis is independent of the axioms of set theory [Clegg] |
10862 | The 'continuum hypothesis' says aleph-one is the cardinality of the reals [Clegg] |
13518 | Modern mathematics has unified all of its objects within set theory [Wolf,RS] |
6005 | Animals are dangerous and nourishing, and can't form contracts of justice [Hermarchus, by Sedley] |