76 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. |
| 9738 | Each line of a truth table is a model [Fitting/Mendelsohn] |
| Full Idea: Each line of a truth table is, in effect, a model. | |
| From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 1.6) | |
| A reaction: I find this comment illuminating. It is being connected with the more complex models of modal logic. Each line of a truth table is a picture of how the world might be. |
| 9727 | Modal logic adds □ (necessarily) and ◊ (possibly) to classical logic [Fitting/Mendelsohn] |
| Full Idea: For modal logic we add to the syntax of classical logic two new unary operators □ (necessarily) and ◊ (possibly). | |
| From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 1.3) |
| 9726 | We let 'R' be the accessibility relation: xRy is read 'y is accessible from x' [Fitting/Mendelsohn] |
| Full Idea: We let 'R' be the accessibility relation: xRy is read 'y is accessible from x'. | |
| From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 1.5) |
| 9737 | The symbol ||- is the 'forcing' relation; 'Γ ||- P' means that P is true in world Γ [Fitting/Mendelsohn] |
| Full Idea: The symbol ||- is used for the 'forcing' relation, as in 'Γ ||- P', which means that P is true in world Γ. | |
| From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 1.6) |
| 13136 | The prefix σ names a possible world, and σ.n names a world accessible from that one [Fitting/Mendelsohn] |
| Full Idea: A 'prefix' is a finite sequence of positive integers. A 'prefixed formula' is an expression of the form σ X, where σ is a prefix and X is a formula. A prefix names a possible world, and σ.n names a world accessible from that one. | |
| From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 2.2) |
| 13727 | A 'constant' domain is the same for all worlds; 'varying' domains can be entirely separate [Fitting/Mendelsohn] |
| Full Idea: In 'constant domain' semantics, the domain of each possible world is the same as every other; in 'varying domain' semantics, the domains need not coincide, or even overlap. | |
| From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 4.5) |
| 9734 | Modern modal logic introduces 'accessibility', saying xRy means 'y is accessible from x' [Fitting/Mendelsohn] |
| Full Idea: Modern modal logic takes into consideration the way the modal relates the possible worlds, called the 'accessibility' relation. .. We let R be the accessibility relation, and xRy reads as 'y is accessible from x. | |
| From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 1.5) | |
| A reaction: There are various types of accessibility, and these define the various modal logics. |
| 9736 | A 'model' is a frame plus specification of propositions true at worlds, written < G,R,||- > [Fitting/Mendelsohn] |
|
Full Idea:
A 'model' is a frame plus a specification of which propositional letters are true at which worlds. It is written as |
|
| From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 1.6) |
| 9735 | A 'frame' is a set G of possible worlds, with an accessibility relation R, written < G,R > [Fitting/Mendelsohn] |
|
Full Idea:
A 'frame' consists of a non-empty set G, whose members are generally called possible worlds, and a binary relation R, on G, generally called the accessibility relation. We say the frame is the pair |
|
| From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 1.6) |
| 9741 | Accessibility relations can be 'reflexive' (self-referring), 'transitive' (carries over), or 'symmetric' (mutual) [Fitting/Mendelsohn] |
| Full Idea: A relation R is 'reflexive' if every world is accessible from itself; 'transitive' if the first world is related to the third world (ΓRΔ and ΔRΩ → ΓRΩ); and 'symmetric' if the accessibility relation is mutual. | |
| From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 1.7) | |
| A reaction: The different systems of modal logic largely depend on how these accessibility relations are specified. There is also the 'serial' relation, which just says that any world has another world accessible to it. |
| 13149 | S5: a) if n ◊X then kX b) if n ¬□X then k ¬X c) if n □X then k X d) if n ¬◊X then k ¬X [Fitting/Mendelsohn] |
| Full Idea: Simplified S5 rules: a) if n ◊X then kX b) if n ¬□X then k ¬X c) if n □X then k X d) if n ¬◊X then k ¬X. 'n' picks any world; in a) and b) 'k' asserts a new world; in c) and d) 'k' refers to a known world | |
| From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 2.3) |
| 9740 | If a proposition is possibly true in a world, it is true in some world accessible from that world [Fitting/Mendelsohn] |
| Full Idea: If a proposition is possibly true in a world, then it is also true in some world which is accessible from that world. That is: Γ ||- ◊X ↔ for some Δ ∈ G, ΓRΔ then Δ ||- X. | |
| From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 1.6) |
| 9739 | If a proposition is necessarily true in a world, it is true in all worlds accessible from that world [Fitting/Mendelsohn] |
| Full Idea: If a proposition is necessarily true in a world, then it is also true in all worlds which are accessible from that world. That is: Γ ||- □X ↔ for every Δ ∈ G, if ΓRΔ then Δ ||- X. | |
| From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 1.6) |
| 13137 | Conj: a) if σ X∧Y then σ X and σ Y b) if σ ¬(X∧Y) then σ ¬X or σ ¬Y [Fitting/Mendelsohn] |
| Full Idea: General tableau rules for conjunctions: a) if σ X ∧ Y then σ X and σ Y b) if σ ¬(X ∧ Y) then σ ¬X or σ ¬Y | |
| From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 2.2) |
| 13140 | Bicon: a)if σ(X↔Y) then σ(X→Y) and σ(Y→X) b) [not biconditional, one or other fails] [Fitting/Mendelsohn] |
| Full Idea: General tableau rules for biconditionals: a) if σ (X ↔ Y) then σ (X → Y) and σ (Y → X) b) if σ ¬(X ↔ Y) then σ ¬(X → Y) or σ ¬(Y → X) | |
| From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 2.2) |
| 13139 | Implic: a) if σ ¬(X→Y) then σ X and σ ¬Y b) if σ X→Y then σ ¬X or σ Y [Fitting/Mendelsohn] |
| Full Idea: General tableau rules for implications: a) if σ ¬(X → Y) then σ X and σ ¬Y b) if σ X → Y then σ ¬X or σ Y | |
| From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 2.2) |
| 13143 | Universal: a) if σ ¬◊X then σ.m ¬X b) if σ □X then σ.m X [m exists] [Fitting/Mendelsohn] |
| Full Idea: General tableau rules for universal modality: a) if σ ¬◊ X then σ.m ¬X b) if σ □ X then σ.m X , where m refers to a world that can be seen (rather than introducing a new world). | |
| From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 2.2) | |
| A reaction: Note that the universal rule of □, usually read as 'necessary', only refers to worlds which can already be seen, whereas possibility (◊) asserts some thing about a new as yet unseen world. |
| 13141 | Negation: if σ ¬¬X then σ X [Fitting/Mendelsohn] |
| Full Idea: General tableau rule for negation: if σ ¬¬X then σ X | |
| From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 2.2) |
| 13138 | Disj: a) if σ ¬(X∨Y) then σ ¬X and σ ¬Y b) if σ X∨Y then σ X or σ Y [Fitting/Mendelsohn] |
| Full Idea: General tableau rules for disjunctions: a) if σ ¬(X ∨ Y) then σ ¬X and σ ¬Y b) if σ X ∨ Y then σ X or σ Y | |
| From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 2.2) |
| 13142 | Existential: a) if σ ◊X then σ.n X b) if σ ¬□X then σ.n ¬X [n is new] [Fitting/Mendelsohn] |
| Full Idea: General tableau rules for existential modality: a) if σ ◊ X then σ.n X b) if σ ¬□ X then σ.n ¬X , where n introduces some new world (rather than referring to a world that can be seen). | |
| From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 2.2) | |
| A reaction: Note that the existential rule of ◊, usually read as 'possibly', asserts something about a new as yet unseen world, whereas □ only refers to worlds which can already be seen, |
| 13144 | T reflexive: a) if σ □X then σ X b) if σ ¬◊X then σ ¬X [Fitting/Mendelsohn] |
| Full Idea: System T reflexive rules (also for B, S4, S5): a) if σ □X then σ X b) if σ ¬◊X then σ ¬X | |
| From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 2.3) |
| 13145 | D serial: a) if σ □X then σ ◊X b) if σ ¬◊X then σ ¬□X [Fitting/Mendelsohn] |
| Full Idea: System D serial rules (also for T, B, S4, S5): a) if σ □X then σ ◊X b) if σ ¬◊X then σ ¬□X | |
| From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 2.3) |
| 13146 | B symmetric: a) if σ.n □X then σ X b) if σ.n ¬◊X then σ ¬X [n occurs] [Fitting/Mendelsohn] |
| Full Idea: System B symmetric rules (also for S5): a) if σ.n □X then σ X b) if σ.n ¬◊X then σ ¬X [where n is a world which already occurs] | |
| From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 2.3) |
| 13147 | 4 transitive: a) if σ □X then σ.n □X b) if σ ¬◊X then σ.n ¬◊X [n occurs] [Fitting/Mendelsohn] |
| Full Idea: System 4 transitive rules (also for K4, S4, S5): a) if σ □X then σ.n □X b) if σ ¬◊X then σ.n ¬◊X [where n is a world which already occurs] | |
| From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 2.3) |
| 13148 | 4r rev-trans: a) if σ.n □X then σ □X b) if σ.n ¬◊X then σ ¬◊X [n occurs] [Fitting/Mendelsohn] |
| Full Idea: System 4r reversed-transitive rules (also for S5): a) if σ.n □X then σ □X b) if σ.n ¬◊X then σ ¬◊X [where n is a world which already occurs] | |
| From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 2.3) |
| 9742 | The system K has no accessibility conditions [Fitting/Mendelsohn] |
| Full Idea: The system K has no frame conditions imposed on its accessibility relation. | |
| From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 1.8) | |
| A reaction: The system is named K in honour of Saul Kripke. |
| 13114 | □P → P is not valid in D (Deontic Logic), since an obligatory action may be not performed [Fitting/Mendelsohn] |
| Full Idea: System D is usually thought of as Deontic Logic, concerning obligations and permissions. □P → P is not valid in D, since just because an action is obligatory, it does not follow that it is performed. | |
| From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 1.12.2 Ex) |
| 9743 | The system D has the 'serial' conditon imposed on its accessibility relation [Fitting/Mendelsohn] |
| Full Idea: The system D has the 'serial' condition imposed on its accessibility relation - that is, every world must have some world which is accessible to it. | |
| From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 1.8) |
| 9744 | The system T has the 'reflexive' conditon imposed on its accessibility relation [Fitting/Mendelsohn] |
| Full Idea: The system T has the 'reflexive' condition imposed on its accessibility relation - that is, every world must be accessible to itself. | |
| From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 1.8) |
| 9746 | The system K4 has the 'transitive' condition on its accessibility relation [Fitting/Mendelsohn] |
| Full Idea: The system K4 has the 'transitive' condition imposed on its accessibility relation - that is, if a relation holds between worlds 1 and 2 and worlds 2 and 3, it must hold between worlds 1 and 3. The relation carries over. | |
| From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 1.8) |
| 9745 | The system B has the 'reflexive' and 'symmetric' conditions on its accessibility relation [Fitting/Mendelsohn] |
| Full Idea: The system B has the 'reflexive' and 'symmetric' conditions imposed on its accessibility relation - that is, every world must be accessible to itself, and any relation between worlds must be mutual. | |
| From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 1.8) |
| 9747 | The system S4 has the 'reflexive' and 'transitive' conditions on its accessibility relation [Fitting/Mendelsohn] |
| Full Idea: The system S4 has the 'reflexive' and 'transitive' conditions imposed on its accessibility relation - that is, every world is accessible to itself, and accessibility carries over a series of worlds. | |
| From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 1.8) |
| 9748 | System S5 has the 'reflexive', 'symmetric' and 'transitive' conditions on its accessibility relation [Fitting/Mendelsohn] |
| Full Idea: The system S5 has the 'reflexive', 'symmetric' and 'transitive' conditions imposed on its accessibility relation - that is, every world is self-accessible, and accessibility is mutual, and it carries over a series of worlds. | |
| From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 1.8) | |
| A reaction: S5 has total accessibility, and hence is the most powerful system (though it might be too powerful). |
| 9404 | Modality affects content, because P→◊P is valid, but ◊P→P isn't [Fitting/Mendelsohn] |
| Full Idea: P→◊P is usually considered to be valid, but its converse, ◊P→P is not, so (by Frege's own criterion) P and possibly-P differ in conceptual content, and there is no reason why logic should not be widened to accommodate this. | |
| From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 1.2) | |
| A reaction: Frege had denied that modality affected the content of a proposition (1879:p.4). The observation here is the foundation for the need for a modal logic. |
| 13112 | In epistemic logic knowers are logically omniscient, so they know that they know [Fitting/Mendelsohn] |
| Full Idea: In epistemic logic the knower is treated as logically omniscient. This is puzzling because one then cannot know something and yet fail to know that one knows it (the Principle of Positive Introspection). | |
| From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 1.11) | |
| A reaction: This is nowadays known as the K-K Problem - to know, must you know that you know. Broadly, we find that externalists say you don't need to know that you know (so animals know things), but internalists say you do need to know that you know. |
| 13111 | Read epistemic box as 'a knows/believes P' and diamond as 'for all a knows/believes, P' [Fitting/Mendelsohn] |
| Full Idea: In epistemic logic we read Υ as 'KaP: a knows that P', and ◊ as 'PaP: it is possible, for all a knows, that P' (a is an individual). For belief we read them as 'BaP: a believes that P' and 'CaP: compatible with everything a believes that P'. | |
| From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 1.11) | |
| A reaction: [scripted capitals and subscripts are involved] Hintikka 1962 is the source of this. Fitting and Mendelsohn prefer □ to read 'a is entitled to know P', rather than 'a knows that P'. |
| 13113 | F: will sometime, P: was sometime, G: will always, H: was always [Fitting/Mendelsohn] |
| Full Idea: We introduce four future and past tense operators: FP: it will sometime be the case that P. PP: it was sometime the case that P. GP: it will always be the case that P. HP: it has always been the case that P. (P itself is untensed). | |
| From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 1.10) | |
| A reaction: Temporal logic begins with A.N. Prior, and starts with □ as 'always', and ◊ as 'sometimes', but then adds these past and future divisions. Two different logics emerge, taking □ and ◊ as either past or as future. |
| 13728 | The Barcan says nothing comes into existence; the Converse says nothing ceases; the pair imply stability [Fitting/Mendelsohn] |
| Full Idea: The Converse Barcan says nothing passes out of existence in alternative situations. The Barcan says that nothing comes into existence. The two together say the same things exist no matter what the situation. | |
| From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 4.9) | |
| A reaction: I take the big problem to be that these reflect what it is you want to say, and that does not keep stable across a conversation, so ordinary rational discussion sometimes asserts these formulas, and 30 seconds later denies them. |
| 13729 | The Barcan corresponds to anti-monotonicity, and the Converse to monotonicity [Fitting/Mendelsohn] |
| Full Idea: The Barcan formula corresponds to anti-monotonicity, and the Converse Barcan formula corresponds to monotonicity. | |
| From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 6.3) |
| 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. |
| 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) |
| 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). |
| 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) |
| 9725 | 'Predicate abstraction' abstracts predicates from formulae, giving scope for constants and functions [Fitting/Mendelsohn] |
| Full Idea: 'Predicate abstraction' is a key idea. It is a syntactic mechanism for abstracting a predicate from a formula, providing a scoping mechanism for constants and function symbols similar to that provided for variables by quantifiers. | |
| From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], Pref) |
| 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. |
| 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) |
| 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). |
| 13730 | The Indiscernibility of Identicals has been a big problem for modal logic [Fitting/Mendelsohn] |
| Full Idea: Equality has caused much grief for modal logic. Many of the problems, which have struck at the heart of the coherence of modal logic, stem from the apparent violations of the Indiscernibility of Identicals. | |
| From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 7.1) | |
| A reaction: Thus when I say 'I might have been three inches taller', presumably I am referring to someone who is 'identical' to me, but who lacks one of my properties. A simple solution is to say that the person is 'essentially' identical. |
| 13725 | □ must be sensitive as to whether it picks out an object by essential or by contingent properties [Fitting/Mendelsohn] |
| Full Idea: If □ is to be sensitive to the quality of the truth of a proposition in its scope, then it must be sensitive as to whether an object is picked out by an essential property or by a contingent one. | |
| From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 4.3) | |
| A reaction: This incredibly simple idea strikes me as being powerful and important. ...However, creating illustrative examples leaves me in a state of confusion. You try it. They cite '9' and 'number of planets'. But is it just nominal essence? '9' must be 9. |
| 13731 | Objects retain their possible properties across worlds, so a bundle theory of them seems best [Fitting/Mendelsohn] |
| Full Idea: The property of 'possibly being a Republican' is as much a property of Bill Clinton as is 'being a democrat'. So we don't peel off his properties from world to world. Hence the bundle theory fits our treatment of objects better than bare particulars. | |
| From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 7.3) | |
| A reaction: This bundle theory is better described in recent parlance as the 'modal profile'. I am reluctant to talk of a modal truth about something as one of its 'properties'. An objects, then, is a bundle of truths? |
| 13726 | Counterpart relations are neither symmetric nor transitive, so there is no logic of equality for them [Fitting/Mendelsohn] |
| Full Idea: The main technical problem with counterpart theory is that the being-a-counterpart relation is, in general, neither symmetric nor transitive, so no natural logic of equality is forthcoming. | |
| From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 4.5) | |
| A reaction: That is, nothing is equal to a counterpart, either directly or indirectly. |
| 16745 | No one even knows the nature and properties of a fly - why it has that colour, or so many feet [Bacon,R] |
| Full Idea: No one is so wise regarding the natural world as to know with certainty all the truths that concern the nature and properties of a single fly, or to know the proper causes of its color and why it has so many feet, neither more nor less. | |
| From: Roger Bacon (Opus Maius (major works) [1254], I.10), quoted by Robert Pasnau - Metaphysical Themes 1274-1671 23.6 | |
| A reaction: Pasnau quotes this in the context of 'occult' qualities. It is scientific essentialism, because Bacon clearly takes it that the explanation of these things would be found within the essence of the fly, if we could only get at it. |