53 ideas
| 17774 | Definitions make our intuitions mathematically useful [Mayberry] |
| 17773 | Proof shows that it is true, but also why it must be true [Mayberry] |
| 10888 | Sets can be defined by 'enumeration', or by 'abstraction' (based on a property) [Zalabardo] |
| 10889 | The 'Cartesian Product' of two sets relates them by pairing every element with every element [Zalabardo] |
| 10890 | A 'partial ordering' is reflexive, antisymmetric and transitive [Zalabardo] |
| 17795 | Set theory can't be axiomatic, because it is needed to express the very notion of axiomatisation [Mayberry] |
| 17796 | There is a semi-categorical axiomatisation of set-theory [Mayberry] |
| 10886 | Determinacy: an object is either in a set, or it isn't [Zalabardo] |
| 17800 | The misnamed Axiom of Infinity says the natural numbers are finite in size [Mayberry] |
| 10887 | Specification: Determinate totals of objects always make a set [Zalabardo] |
| 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] |
| 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] |
| 10897 | A first-order 'sentence' is a formula with no free variables [Zalabardo] |
| 17791 | Only second-order logic can capture mathematical structure up to isomorphism [Mayberry] |
| 10893 | Γ |= φ for sentences if φ is true when all of Γ is true [Zalabardo] |
| 10899 | Γ |= φ if φ is true when all of Γ is true, for all structures and interpretations [Zalabardo] |
| 10896 | Propositional logic just needs ¬, and one of ∧, ∨ and → [Zalabardo] |
| 17787 | Big logic has one fixed domain, but standard logic has a domain for each interpretation [Mayberry] |
| 10898 | The semantics shows how truth values depend on instantiations of properties and relations [Zalabardo] |
| 10902 | We can do semantics by looking at given propositions, or by building new ones [Zalabardo] |
| 10892 | We make a truth assignment to T and F, which may be true and false, but merely differ from one another [Zalabardo] |
| 10900 | Logically true sentences are true in all structures [Zalabardo] |
| 10895 | 'Logically true' (|= φ) is true for every truth-assignment [Zalabardo] |
| 10901 | Some formulas are 'satisfiable' if there is a structure and interpretation that makes them true [Zalabardo] |
| 10894 | A sentence-set is 'satisfiable' if at least one truth-assignment makes them all true [Zalabardo] |
| 10903 | A structure models a sentence if it is true in the model, and a set of sentences if they are all true in the model [Zalabardo] |
| 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] |
| 17789 | No logic which can axiomatise arithmetic can be compact or complete [Mayberry] |
| 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] |
| 10891 | If a set is defined by induction, then proof by induction can be applied to it [Zalabardo] |
| 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] |
| 16062 | A necessary relation between fact-levels seems to be a further irreducible fact [Lynch/Glasgow] |
| 16061 | If some facts 'logically supervene' on some others, they just redescribe them, adding nothing [Lynch/Glasgow] |
| 16060 | Nonreductive materialism says upper 'levels' depend on lower, but don't 'reduce' [Lynch/Glasgow] |
| 16064 | The hallmark of physicalism is that each causal power has a base causal power under it [Lynch/Glasgow] |
| 17785 | Real numbers as abstracted objects are now treated as complete ordered fields [Mayberry] |