36 ideas
10476 | The idea that groups of concepts could be 'implicitly defined' was abandoned [Hodges,W] |
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] |
10282 | Logic is the study of sound argument, or of certain artificial languages (or applying the latter to the former) [Hodges,W] |
10478 | Since first-order languages are complete, |= and |- have the same meaning [Hodges,W] |
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] |
10477 | |= in model-theory means 'logical consequence' - it holds in all models [Hodges,W] |
10283 | A formula needs an 'interpretation' of its constants, and a 'valuation' of its variables [Hodges,W] |
10284 | There are three different standard presentations of semantics [Hodges,W] |
10285 | I |= φ means that the formula φ is true in the interpretation I [Hodges,W] |
10474 | |= should be read as 'is a model for' or 'satisfies' [Hodges,W] |
10481 | Models in model theory are structures, not sets of descriptions [Hodges,W] |
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] |
10473 | Model theory studies formal or natural language-interpretation using set-theory [Hodges,W] |
10475 | A 'structure' is an interpretation specifying objects and classes of quantification [Hodges,W] |
13537 | An 'isomorphism' is a bijection that preserves all structural components [Wolf,RS] |
10288 | Down Löwenheim-Skolem: if a countable language has a consistent theory, that has a countable model [Hodges,W] |
10289 | Up Löwenheim-Skolem: if infinite models, then arbitrarily large models [Hodges,W] |
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] |
10287 | If a first-order theory entails a sentence, there is a finite subset of the theory which entails it [Hodges,W] |
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] |
10480 | First-order logic can't discriminate between one infinite cardinal and another [Hodges,W] |
10286 | A 'set' is a mathematically well-behaved class [Hodges,W] |
13518 | Modern mathematics has unified all of its objects within set theory [Wolf,RS] |
7258 | The forefather of modern intuitionism is Richard Price [Price,R, by Dancy,J] |