30 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] |
6299 | Axioms are often affirmed simply because they produce results which have been accepted [Resnik] |
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] |
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] |
6007 | If you know your father, but don't recognise your father veiled, you know and don't know the same person [Eubulides, by Dancy,R] |
6006 | If you say truly that you are lying, you are lying [Eubulides, by Dancy,R] |
6008 | Removing one grain doesn't destroy a heap, so a heap can't be destroyed [Eubulides, by Dancy,R] |
6304 | Mathematical realism says that maths exists, is largely true, and is independent of proofs [Resnik] |
13530 | An ordinal is an equivalence class of well-orderings, or a transitive set whose members are transitive [Wolf,RS] |
13518 | Modern mathematics has unified all of its objects within set theory [Wolf,RS] |
6300 | Mathematical constants and quantifiers only exist as locations within structures or patterns [Resnik] |
6303 | Sets are positions in patterns [Resnik] |
6302 | Structuralism must explain why a triangle is a whole, and not a random set of points [Resnik] |
6295 | There are too many mathematical objects for them all to be mental or physical [Resnik] |
6296 | Maths is pattern recognition and representation, and its truth and proofs are based on these [Resnik] |
6301 | Congruence is the strongest relationship of patterns, equivalence comes next, and mutual occurrence is the weakest [Resnik] |