51 ideas
| 17774 | Definitions make our intuitions mathematically useful [Mayberry] |
| 17773 | Proof shows that it is true, but also why it must be true [Mayberry] |
| 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] |
| 17795 | Set theory can't be axiomatic, because it is needed to express the very notion of axiomatisation [Mayberry] |
| 17796 | There is a semi-categorical axiomatisation of set-theory [Mayberry] |
| 13529 | Empty Set: ∃x∀y ¬(y∈x). The unique empty set exists [Wolf,RS] |
| 17800 | The misnamed Axiom of Infinity says the natural numbers are finite in size [Mayberry] |
| 13526 | Comprehension Axiom: if a collection is clearly specified, it is a set [Wolf,RS] |
| 17801 | The set hierarchy doesn't rely on the dubious notion of 'generating' them [Mayberry] |
| 17803 | Limitation of size is part of the very conception of a set [Mayberry] |
| 17786 | The mainstream of modern logic sees it as a branch of mathematics [Mayberry] |
| 17788 | First-order logic only has its main theorems because it is so weak [Mayberry] |
| 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] |
| 17791 | Only second-order logic can capture mathematical structure up to isomorphism [Mayberry] |
| 17787 | Big logic has one fixed domain, but standard logic has a domain for each interpretation [Mayberry] |
| 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] |
| 17790 | No Löwenheim-Skolem logic can axiomatise real analysis [Mayberry] |
| 17779 | 'Classificatory' axioms aim at revealing similarity in morphology of structures [Mayberry] |
| 17778 | Axiomatiation relies on isomorphic structures being essentially the same [Mayberry] |
| 17780 | 'Eliminatory' axioms get rid of traditional ideal and abstract objects [Mayberry] |
| 13538 | If a theory is complete, only a more powerful language can strengthen it [Wolf,RS] |
| 17789 | No logic which can axiomatise arithmetic can be compact or complete [Mayberry] |
| 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] |
| 17784 | Real numbers can be eliminated, by axiom systems for complete ordered fields [Mayberry] |
| 17782 | Greek quantities were concrete, and ratio and proportion were their science [Mayberry] |
| 17781 | Real numbers were invented, as objects, to simplify and generalise 'quantity' [Mayberry] |
| 17799 | Cantor's infinite is an absolute, of all the sets or all the ordinal numbers [Mayberry] |
| 17797 | Cantor extended the finite (rather than 'taming the infinite') [Mayberry] |
| 17775 | If proof and definition are central, then mathematics needs and possesses foundations [Mayberry] |
| 17776 | The ultimate principles and concepts of mathematics are presumed, or grasped directly [Mayberry] |
| 17777 | Foundations need concepts, definition rules, premises, and proof rules [Mayberry] |
| 17804 | Axiom theories can't give foundations for mathematics - that's using axioms to explain axioms [Mayberry] |
| 17792 | 1st-order PA is only interesting because of results which use 2nd-order PA [Mayberry] |
| 17793 | It is only 2nd-order isomorphism which suggested first-order PA completeness [Mayberry] |
| 17794 | Set theory is not just first-order ZF, because that is inadequate for mathematics [Mayberry] |
| 17802 | We don't translate mathematics into set theory, because it comes embodied in that way [Mayberry] |
| 17805 | Set theory is not just another axiomatised part of mathematics [Mayberry] |
| 13518 | Modern mathematics has unified all of its objects within set theory [Wolf,RS] |
| 17785 | Real numbers as abstracted objects are now treated as complete ordered fields [Mayberry] |
| 20653 | Six reduction levels: groups, lives, cells, molecules, atoms, particles [Putnam/Oppenheim, by Watson] |