39 ideas
| 10170 | While true-in-a-model seems relative, true-in-all-models seems not to be [Reck/Price] |
| 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] |
| 10166 | ZFC set theory has only 'pure' sets, without 'urelements' [Reck/Price] |
| 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] |
| 10175 | Three types of variable in second-order logic, for objects, functions, and predicates/sets [Reck/Price] |
| 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] |
| 13530 | An ordinal is an equivalence class of well-orderings, or a transitive set whose members are transitive [Wolf,RS] |
| 10165 | 'Analysis' is the theory of the real numbers [Reck/Price] |
| 10174 | Mereological arithmetic needs infinite objects, and function definitions [Reck/Price] |
| 10164 | Peano Arithmetic can have three second-order axioms, plus '1' and 'successor' [Reck/Price] |
| 10172 | Set-theory gives a unified and an explicit basis for mathematics [Reck/Price] |
| 13518 | Modern mathematics has unified all of its objects within set theory [Wolf,RS] |
| 10167 | Structuralism emerged from abstract algebra, axioms, and set theory and its structures [Reck/Price] |
| 10169 | Relativist Structuralism just stipulates one successful model as its arithmetic [Reck/Price] |
| 10179 | There are 'particular' structures, and 'universal' structures (what the former have in common) [Reck/Price] |
| 10181 | Pattern Structuralism studies what isomorphic arithmetic models have in common [Reck/Price] |
| 10182 | There are Formalist, Relativist, Universalist and Pattern structuralism [Reck/Price] |
| 10168 | Formalist Structuralism says the ontology is vacuous, or formal, or inference relations [Reck/Price] |
| 10178 | Maybe we should talk of an infinity of 'possible' objects, to avoid arithmetic being vacuous [Reck/Price] |
| 10176 | Universalist Structuralism is based on generalised if-then claims, not one particular model [Reck/Price] |
| 10177 | Universalist Structuralism eliminates the base element, as a variable, which is then quantified out [Reck/Price] |
| 10171 | The existence of an infinite set is assumed by Relativist Structuralism [Reck/Price] |
| 10173 | A nominalist might avoid abstract objects by just appealing to mereological sums [Reck/Price] |
| 23304 | The ancient Memorists said virtually all types of thinking could be done simply by memory [Sorabji] |
| 23303 | Stoics say true memory needs reflection and assent, but animals only have perceptual recognition [Sorabji] |