62 ideas
17774 | Definitions make our intuitions mathematically useful [Mayberry] |
17773 | Proof shows that it is true, but also why it must be true [Mayberry] |
9724 | Until the 1960s the only semantics was truth-tables [Enderton] |
9707 | 'F(x)' is the unique value which F assumes for a value of x [Enderton] |
9705 | 'fld R' indicates the 'field' of all objects in the relation [Enderton] |
9704 | 'ran R' indicates the 'range' of objects being related to [Enderton] |
9703 | 'dom R' indicates the 'domain' of objects having a relation [Enderton] |
9710 | We write F:A→B to indicate that A maps into B (the output of F on A is in B) [Enderton] |
9699 | The 'powerset' of a set is all the subsets of a given set [Enderton] |
9700 | Two sets are 'disjoint' iff their intersection is empty [Enderton] |
9712 | A relation is 'symmetric' on a set if every ordered pair has the relation in both directions [Enderton] |
9713 | A relation is 'transitive' if it can be carried over from two ordered pairs to a third [Enderton] |
9701 | A 'relation' is a set of ordered pairs [Enderton] |
9702 | A 'domain' of a relation is the set of members of ordered pairs in the relation [Enderton] |
9708 | A function 'maps A into B' if the relating things are set A, and the things related to are all in B [Enderton] |
9709 | A function 'maps A onto B' if the relating things are set A, and the things related to are set B [Enderton] |
9711 | A relation is 'reflexive' on a set if every member bears the relation to itself [Enderton] |
9706 | A 'function' is a relation in which each object is related to just one other object [Enderton] |
9714 | A relation satisfies 'trichotomy' if all pairs are either relations, or contain identical objects [Enderton] |
9717 | A set is 'dominated' by another if a one-to-one function maps the first set into a subset of the second [Enderton] |
9716 | We 'partition' a set into distinct subsets, according to each relation on its objects [Enderton] |
9715 | An 'equivalence relation' is a reflexive, symmetric and transitive binary relation [Enderton] |
17796 | There is a semi-categorical axiomatisation of set-theory [Mayberry] |
17795 | Set theory can't be axiomatic, because it is needed to express the very notion of axiomatisation [Mayberry] |
17800 | The misnamed Axiom of Infinity says the natural numbers are finite in size [Mayberry] |
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] |
9722 | Inference not from content, but from the fact that it was said, is 'conversational implicature' [Enderton] |
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] |
17791 | Only second-order logic can capture mathematical structure up to isomorphism [Mayberry] |
9718 | Validity is either semantic (what preserves truth), or proof-theoretic (following procedures) [Enderton] |
17787 | Big logic has one fixed domain, but standard logic has a domain for each interpretation [Mayberry] |
9721 | A logical truth or tautology is a logical consequence of the empty set [Enderton] |
9994 | A truth assignment to the components of a wff 'satisfy' it if the wff is then True [Enderton] |
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] |
9719 | A proof theory is 'sound' if its valid inferences entail semantic validity [Enderton] |
9720 | A proof theory is 'complete' if semantically valid inferences entail proof-theoretic validity [Enderton] |
9995 | Proof in finite subsets is sufficient for proof in an infinite set [Enderton] |
17789 | No logic which can axiomatise arithmetic can be compact or complete [Mayberry] |
9996 | Expressions are 'decidable' if inclusion in them (or not) can be proved [Enderton] |
9997 | For a reasonable language, the set of valid wff's can always be enumerated [Enderton] |
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] |
17785 | Real numbers as abstracted objects are now treated as complete ordered fields [Mayberry] |
9723 | Sentences with 'if' are only conditionals if they can read as A-implies-B [Enderton] |
467 | A virtue is a combination of intelligence, strength and luck [Ion] |