50 ideas
| 17774 | Definitions make our intuitions mathematically useful [Mayberry] |
| Full Idea: Definition provides us with the means for converting our intuitions into mathematically usable concepts. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.405-1) |
| 17773 | Proof shows that it is true, but also why it must be true [Mayberry] |
| Full Idea: When you have proved something you know not only that it is true, but why it must be true. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.405-2) | |
| A reaction: Note the word 'must'. Presumably both the grounding and the necessitation of the truth are revealed. |
| 10888 | Sets can be defined by 'enumeration', or by 'abstraction' (based on a property) [Zalabardo] |
| Full Idea: We can define a set by 'enumeration' (by listing the items, within curly brackets), or by 'abstraction' (by specifying the elements as instances of a property), pretending that they form a determinate totality. The latter is written {x | x is P}. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §1.3) |
| 10889 | The 'Cartesian Product' of two sets relates them by pairing every element with every element [Zalabardo] |
|
Full Idea:
The 'Cartesian Product' of two sets, written A x B, is the relation which pairs every element of A with every element of B. So A x B = { |
|
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §1.6) |
| 10890 | A 'partial ordering' is reflexive, antisymmetric and transitive [Zalabardo] |
| Full Idea: A binary relation in a set is a 'partial ordering' just in case it is reflexive, antisymmetric and transitive. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §1.6) |
| 17795 | Set theory can't be axiomatic, because it is needed to express the very notion of axiomatisation [Mayberry] |
| Full Idea: Set theory cannot be an axiomatic theory, because the very notion of an axiomatic theory makes no sense without it. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.413-2) | |
| A reaction: This will come as a surprise to Penelope Maddy, who battles with ways to accept the set theory axioms as the foundation of mathematics. Mayberry says that the basic set theory required is much more simple and intuitive. |
| 17796 | There is a semi-categorical axiomatisation of set-theory [Mayberry] |
| Full Idea: We can give a semi-categorical axiomatisation of set-theory (all that remains undetermined is the size of the set of urelements and the length of the sequence of ordinals). The system is second-order in formalisation. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.413-2) | |
| A reaction: I gather this means the models may not be isomorphic to one another (because they differ in size), but can be shown to isomorphic to some third ingredient. I think. Mayberry says this shows there is no such thing as non-Cantorian set theory. |
| 10886 | Determinacy: an object is either in a set, or it isn't [Zalabardo] |
| Full Idea: Principle of Determinacy: For every object a and every set S, either a is an element of S or a is not an element of S. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §1.2) |
| 17800 | The misnamed Axiom of Infinity says the natural numbers are finite in size [Mayberry] |
| Full Idea: The (misnamed!) Axiom of Infinity expresses Cantor's fundamental assumption that the species of natural numbers is finite in size. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.414-2) |
| 10887 | Specification: Determinate totals of objects always make a set [Zalabardo] |
| Full Idea: Principle of Specification: Whenever we can specify a determinate totality of objects, we shall say that there is a set whose elements are precisely the objects that we have specified. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §1.3) | |
| A reaction: Compare the Axiom of Specification. Zalabardo says we may wish to consider sets of which we cannot specify the members. |
| 17801 | The set hierarchy doesn't rely on the dubious notion of 'generating' them [Mayberry] |
| Full Idea: The idea of 'generating' sets is only a metaphor - the existence of the hierarchy is established without appealing to such dubious notions. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.414-2) | |
| A reaction: Presumably there can be a 'dependence' or 'determination' relation which does not involve actual generation. |
| 17803 | Limitation of size is part of the very conception of a set [Mayberry] |
| Full Idea: Our very notion of a set is that of an extensional plurality limited in size. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.415-2) |
| 17786 | The mainstream of modern logic sees it as a branch of mathematics [Mayberry] |
| Full Idea: In the mainstream tradition of modern logic, beginning with Boole, Peirce and Schröder, descending through Löwenheim and Skolem to reach maturity with Tarski and his school ...saw logic as a branch of mathematics. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.410-1) | |
| A reaction: [The lesser tradition, of Frege and Russell, says mathematics is a branch of logic]. Mayberry says the Fregean tradition 'has almost died out'. |
| 17788 | First-order logic only has its main theorems because it is so weak [Mayberry] |
| Full Idea: First-order logic is very weak, but therein lies its strength. Its principle tools (Compactness, Completeness, Löwenheim-Skolem Theorems) can be established only because it is too weak to axiomatize either arithmetic or analysis. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.411-2) | |
| A reaction: He adds the proviso that this is 'unless we are dealing with structures on whose size we have placed an explicit, finite bound' (p.412-1). |
| 10897 | A first-order 'sentence' is a formula with no free variables [Zalabardo] |
| Full Idea: A formula of a first-order language is a 'sentence' just in case it has no free variables. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §3.2) |
| 17791 | Only second-order logic can capture mathematical structure up to isomorphism [Mayberry] |
| Full Idea: Second-order logic is a powerful tool of definition: by means of it alone we can capture mathematical structure up to isomorphism using simple axiom systems. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.412-1) |
| 10893 | Γ |= φ for sentences if φ is true when all of Γ is true [Zalabardo] |
| Full Idea: A propositional logic sentence is a 'logical consequence' of a set of sentences (written Γ |= φ) if for every admissible truth-assignment all the sentences in the set Γ are true, then φ is true. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §2.4) | |
| A reaction: The definition is similar for predicate logic. |
| 10899 | Γ |= φ if φ is true when all of Γ is true, for all structures and interpretations [Zalabardo] |
| Full Idea: A formula is the 'logical consequence' of a set of formulas (Γ |= φ) if for every structure in the language and every variable interpretation of the structure, if all the formulas within the set are true and the formula itself is true. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §3.5) |
| 10896 | Propositional logic just needs ¬, and one of ∧, ∨ and → [Zalabardo] |
| Full Idea: In propositional logic, any set containing ¬ and at least one of ∧, ∨ and → is expressively complete. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §2.8) |
| 17787 | Big logic has one fixed domain, but standard logic has a domain for each interpretation [Mayberry] |
| Full Idea: The 'logica magna' [of the Fregean tradition] has quantifiers ranging over a fixed domain, namely everything there is. In the Boolean tradition the domains differ from interpretation to interpretation. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.410-2) | |
| A reaction: Modal logic displays both approaches, with different systems for global and local domains. |
| 10898 | The semantics shows how truth values depend on instantiations of properties and relations [Zalabardo] |
| Full Idea: The semantic pattern of a first-order language is the ways in which truth values depend on which individuals instantiate the properties and relations which figure in them. ..So we pair a truth value with each combination of individuals, sets etc. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §3.3) | |
| A reaction: So truth reduces to a combination of 'instantiations', which is rather like 'satisfaction'. |
| 10902 | We can do semantics by looking at given propositions, or by building new ones [Zalabardo] |
| Full Idea: We can look at semantics from the point of view of how truth values are determined by instantiations of properties and relations, or by asking how we can build, using the resources of the language, a proposition corresponding to a given semantic pattern. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §3.6) | |
| A reaction: The second version of semantics is model theory. |
| 10892 | We make a truth assignment to T and F, which may be true and false, but merely differ from one another [Zalabardo] |
| Full Idea: A truth assignment is a function from propositions to the set {T,F}. We will think of T and F as the truth values true and false, but for our purposes all we need to assume about the identity of these objects is that they are different from each other. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §2.4) | |
| A reaction: Note that T and F are 'objects'. This remark is important in understanding modern logical semantics. T and F can be equated to 1 and 0 in the language of a computer. They just mean as much as you want them to mean. |
| 10900 | Logically true sentences are true in all structures [Zalabardo] |
| Full Idea: In first-order languages, logically true sentences are true in all structures. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §3.5) |
| 10895 | 'Logically true' (|= φ) is true for every truth-assignment [Zalabardo] |
| Full Idea: A propositional logic sentence is 'logically true', written |= φ, if it is true for every admissible truth-assignment. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §2.4) |
| 10901 | Some formulas are 'satisfiable' if there is a structure and interpretation that makes them true [Zalabardo] |
| Full Idea: A set of formulas of a first-order language is 'satisfiable' if there is a structure and a variable interpretation in that structure such that all the formulas of the set are true. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §3.5) |
| 10894 | A sentence-set is 'satisfiable' if at least one truth-assignment makes them all true [Zalabardo] |
| Full Idea: A propositional logic set of sentences Γ is 'satisfiable' if there is at least one admissible truth-assignment that makes all of its sentences true. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §2.4) |
| 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] |
| Full Idea: A structure is a model of a sentence if the sentence is true in the model; a structure is a model of a set of sentences if they are all true in the structure. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §3.6) |
| 17790 | No Löwenheim-Skolem logic can axiomatise real analysis [Mayberry] |
| Full Idea: No logic which can axiomatize real analysis can have the Löwenheim-Skolem property. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.412-1) |
| 17779 | 'Classificatory' axioms aim at revealing similarity in morphology of structures [Mayberry] |
| Full Idea: The purpose of a 'classificatory' axiomatic theory is to single out an otherwise disparate species of structures by fixing certain features of morphology. ...The aim is to single out common features. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.406-2) |
| 17778 | Axiomatiation relies on isomorphic structures being essentially the same [Mayberry] |
| Full Idea: The central dogma of the axiomatic method is this: isomorphic structures are mathematically indistinguishable in their essential properties. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.406-2) | |
| A reaction: Hence it is not that we have to settle for the success of a system 'up to isomorphism', since that was the original aim. The structures must differ in their non-essential properties, or they would be the same system. |
| 17780 | 'Eliminatory' axioms get rid of traditional ideal and abstract objects [Mayberry] |
| Full Idea: The purpose of what I am calling 'eliminatory' axiomatic theories is precisely to eliminate from mathematics those peculiar ideal and abstract objects that, on the traditional view, constitute its subject matter. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.407-1) | |
| A reaction: A very interesting idea. I have a natural antipathy to 'abstract objects', because they really mess up what could otherwise be a very tidy ontology. What he describes might be better called 'ignoring' axioms. The objects may 'exist', but who cares? |
| 17789 | No logic which can axiomatise arithmetic can be compact or complete [Mayberry] |
| Full Idea: No logic which can axiomatise arithmetic can be compact or complete. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.412-1) | |
| A reaction: I take this to be because there are new truths in the transfinite level (as well as the problem of incompleteness). |
| 17784 | Real numbers can be eliminated, by axiom systems for complete ordered fields [Mayberry] |
| Full Idea: We eliminate the real numbers by giving an axiomatic definition of the species of complete ordered fields. These axioms are categorical (mutually isomorphic), and thus are mathematically indistinguishable. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.408-2) | |
| A reaction: Hence my clever mathematical friend says that it is a terrible misunderstanding to think that mathematics is about numbers. Mayberry says the reals are one ordered field, but mathematics now studies all ordered fields together. |
| 17782 | Greek quantities were concrete, and ratio and proportion were their science [Mayberry] |
| Full Idea: Quantities for Greeks were concrete things - lines, surfaces, solids, times, weights. At the centre of their science of quantity was the beautiful theory of ratio and proportion (...in which the notion of number does not appear!). | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.407-2) | |
| A reaction: [He credits Eudoxus, and cites Book V of Euclid] |
| 17781 | Real numbers were invented, as objects, to simplify and generalise 'quantity' [Mayberry] |
| Full Idea: The abstract objects of modern mathematics, the real numbers, were invented by the mathematicians of the seventeenth century in order to simplify and to generalize the Greek science of quantity. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.407-2) |
| 17799 | Cantor's infinite is an absolute, of all the sets or all the ordinal numbers [Mayberry] |
| Full Idea: In Cantor's new vision, the infinite, the genuine infinite, does not disappear, but presents itself in the guise of the absolute, as manifested in the species of all sets or the species of all ordinal numbers. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.414-2) |
| 17797 | Cantor extended the finite (rather than 'taming the infinite') [Mayberry] |
| Full Idea: We may describe Cantor's achievement by saying, not that he tamed the infinite, but that he extended the finite. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.414-2) |
| 17775 | If proof and definition are central, then mathematics needs and possesses foundations [Mayberry] |
| Full Idea: If we grant, as surely we must, the central importance of proof and definition, then we must also grant that mathematics not only needs, but in fact has, foundations. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.405-1) |
| 17776 | The ultimate principles and concepts of mathematics are presumed, or grasped directly [Mayberry] |
| Full Idea: The ultimate principles upon which mathematics rests are those to which mathematicians appeal without proof; and the primitive concepts of mathematics ...themselves are grasped directly, if grasped at all, without the mediation of definition. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.405-1) | |
| A reaction: This begs the question of whether the 'grasping' is purely a priori, or whether it derives from experience. I defend the latter, and Jenkins puts the case well. |
| 17777 | Foundations need concepts, definition rules, premises, and proof rules [Mayberry] |
| Full Idea: An account of the foundations of mathematics must specify four things: the primitive concepts for use in definitions, the rules governing definitions, the ultimate premises of proofs, and rules allowing advance from premises to conclusions. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.405-2) |
| 17804 | Axiom theories can't give foundations for mathematics - that's using axioms to explain axioms [Mayberry] |
| Full Idea: No axiomatic theory, formal or informal, of first or of higher order can logically play a foundational role in mathematics. ...It is obvious that you cannot use the axiomatic method to explain what the axiomatic method is. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.415-2) |
| 17792 | 1st-order PA is only interesting because of results which use 2nd-order PA [Mayberry] |
| Full Idea: The sole theoretical interest of first-order Peano arithmetic derives from the fact that it is a first-order reduct of a categorical second-order theory. Its axioms can be proved incomplete only because the second-order theory is categorical. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.412-1) |
| 10891 | If a set is defined by induction, then proof by induction can be applied to it [Zalabardo] |
| Full Idea: Defining a set by induction enables us to use the method of proof by induction to establish that all the elements of the set have a certain property. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §2.3) |
| 17793 | It is only 2nd-order isomorphism which suggested first-order PA completeness [Mayberry] |
| Full Idea: If we did not know that the second-order axioms characterise the natural numbers up to isomorphism, we should have no reason to suppose, a priori, that first-order Peano Arithmetic should be complete. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.412-1) |
| 17794 | Set theory is not just first-order ZF, because that is inadequate for mathematics [Mayberry] |
| Full Idea: The idea that set theory must simply be identified with first-order Zermelo-Fraenkel is surprisingly widespread. ...The first-order axiomatic theory of sets is clearly inadequate as a foundation of mathematics. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.412-2) | |
| A reaction: [He is agreeing with a quotation from Skolem]. |
| 17802 | We don't translate mathematics into set theory, because it comes embodied in that way [Mayberry] |
| Full Idea: One does not have to translate 'ordinary' mathematics into the Zermelo-Fraenkel system: ordinary mathematics comes embodied in that system. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.415-1) | |
| A reaction: Mayberry seems to be a particular fan of set theory as spelling out the underlying facts of mathematics, though it has to be second-order. |
| 17805 | Set theory is not just another axiomatised part of mathematics [Mayberry] |
| Full Idea: The fons et origo of all confusion is the view that set theory is just another axiomatic theory and the universe of sets just another mathematical structure. ...The universe of sets ...is the world that all mathematical structures inhabit. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.416-1) |
| 17785 | Real numbers as abstracted objects are now treated as complete ordered fields [Mayberry] |
| Full Idea: The abstractness of the old fashioned real numbers has been replaced by generality in the modern theory of complete ordered fields. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.408-2) | |
| A reaction: In philosophy, I'm increasingly thinking that we should talk much more of 'generality', and a great deal less about 'universals'. (By which I don't mean that redness is just the set of red things). |
| 6005 | Animals are dangerous and nourishing, and can't form contracts of justice [Hermarchus, by Sedley] |
| Full Idea: Hermarchus said that animal killing is justified by considerations of human safety and nourishment and by animals' inability to form contractual relations of justice with us. | |
| From: report of Hermarchus (fragments/reports [c.270 BCE]) by David A. Sedley - Hermarchus | |
| A reaction: Could the last argument be used to justify torturing animals? Or could we eat a human who was too brain-damaged to form contracts? |