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] |
| 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] |
| 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] |
| 8729 | Intuitionists deny excluded middle, because it is committed to transcendent truth or objects [Shapiro] |
| 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] |
| 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] |
| 8763 | The number 3 is presumably identical as a natural, an integer, a rational, a real, and complex [Shapiro] |
| 13530 | An ordinal is an equivalence class of well-orderings, or a transitive set whose members are transitive [Wolf,RS] |
| 18249 | Cauchy gave a formal definition of a converging sequence. [Shapiro] |
| 8764 | Categories are the best foundation for mathematics [Shapiro] |
| 8762 | Two definitions of 3 in terms of sets disagree over whether 1 is a member of 3 [Shapiro] |
| 13518 | Modern mathematics has unified all of its objects within set theory [Wolf,RS] |
| 8760 | Numbers do not exist independently; the essence of a number is its relations to other numbers [Shapiro] |
| 8761 | A 'system' is related objects; a 'pattern' or 'structure' abstracts the pure relations from them [Shapiro] |
| 8744 | Logicism seems to be a non-starter if (as is widely held) logic has no ontology of its own [Shapiro] |
| 8749 | Term Formalism says mathematics is just about symbols - but real numbers have no names [Shapiro] |
| 8750 | Game Formalism is just a matter of rules, like chess - but then why is it useful in science? [Shapiro] |
| 8752 | Deductivism says mathematics is logical consequences of uninterpreted axioms [Shapiro] |
| 8753 | Critics resent the way intuitionism cripples mathematics, but it allows new important distinctions [Shapiro] |
| 8731 | Conceptualist are just realists or idealist or nominalists, depending on their view of concepts [Shapiro] |
| 8730 | 'Impredicative' definitions refer to the thing being described [Shapiro] |
| 8725 | Rationalism tries to apply mathematical methodology to all of knowledge [Shapiro] |
| 7517 | I could take a healthy infant and train it up to be any type of specialist I choose [Watson,JB] |