68 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. |
| 15413 | With four tense operators, all complex tenses reduce to fourteen basic cases [Burgess] |
| Full Idea: Fand P as 'will' and 'was', G as 'always going to be', H as 'always has been', all tenses reduce to 14 cases: the past series, each implying the next, FH,H,PH,HP,P,GP, and the future series PG,G,FG,GF,F,HF, plus GH=HG implying all, FP=PF which all imply. | |
| From: John P. Burgess (Philosophical Logic [2009], 2.8) | |
| A reaction: I have tried to translate the fourteen into English, but am not quite confident enough to publish them here. I leave it as an exercise for the reader. |
| 15415 | The temporal Barcan formulas fix what exists, which seems absurd [Burgess] |
| Full Idea: In temporal logic, if the converse Barcan formula holds then nothing goes out of existence, and the direct Barcan formula holds if nothing ever comes into existence. These results highlight the intuitive absurdity of the Barcan formulas. | |
| From: John P. Burgess (Philosophical Logic [2009], 2.9) | |
| A reaction: This is my reaction to the modal cases as well - the absurdity of thinking that no actually nonexistent thing might possibly have existed, or that the actual existents might not have existed. Williamson seems to be the biggest friend of the formulas. |
| 15430 | Is classical logic a part of intuitionist logic, or vice versa? [Burgess] |
| Full Idea: From one point of view intuitionistic logic is a part of classical logic, missing one axiom, from another classical logic is a part of intuitionistic logic, missing two connectives, intuitionistic v and → | |
| From: John P. Burgess (Philosophical Logic [2009], 6.4) |
| 15431 | It is still unsettled whether standard intuitionist logic is complete [Burgess] |
| Full Idea: The question of the completeness of the full intuitionistic logic for its intended interpretation is not yet fully resolved. | |
| From: John P. Burgess (Philosophical Logic [2009], 6.9) |
| 15429 | Relevance logic's → is perhaps expressible by 'if A, then B, for that reason' [Burgess] |
| Full Idea: The relevantist logician's → is perhaps expressible by 'if A, then B, for that reason'. | |
| From: John P. Burgess (Philosophical Logic [2009], 5.8) |
| 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'. |
| 15404 | Technical people see logic as any formal system that can be studied, not a study of argument validity [Burgess] |
| Full Idea: Among the more technically oriented a 'logic' no longer means a theory about which forms of argument are valid, but rather means any formalism, regardless of its applications, that resembles original logic enough to be studied by similar methods. | |
| From: John P. Burgess (Philosophical Logic [2009], Pref) | |
| A reaction: There doesn't seem to be any great intellectual obligation to be 'technical'. As far as pure logic is concerned, I am very drawn to the computer approach, since I take that to be the original dream of Aristotle and Leibniz - impersonal precision. |
| 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). |
| 15405 | Classical logic neglects the non-mathematical, such as temporality or modality [Burgess] |
| Full Idea: There are topics of great philosophical interest that classical logic neglects because they are not important to mathematics. …These include distinctions of past, present and future, or of necessary, actual and possible. | |
| From: John P. Burgess (Philosophical Logic [2009], 1.1) |
| 15427 | The Cut Rule expresses the classical idea that entailment is transitive [Burgess] |
| Full Idea: The Cut rule (from A|-B and B|-C, infer A|-C) directly expresses the classical doctrine that entailment is transitive. | |
| From: John P. Burgess (Philosophical Logic [2009], 5.3) |
| 15421 | Classical logic neglects counterfactuals, temporality and modality, because maths doesn't use them [Burgess] |
| Full Idea: Classical logic neglects counterfactual conditionals for the same reason it neglects temporal and modal distinctions, namely, that they play no serious role in mathematics. | |
| From: John P. Burgess (Philosophical Logic [2009], 4.1) | |
| A reaction: Science obviously needs counterfactuals, and metaphysics needs modality. Maybe so-called 'classical' logic will be renamed 'basic mathematical logic'. Philosophy will become a lot clearer when that happens. |
| 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) |
| 15403 | Philosophical logic is a branch of logic, and is now centred in computer science [Burgess] |
| Full Idea: Philosophical logic is a branch of logic, a technical subject. …Its centre of gravity today lies in theoretical computer science. | |
| From: John P. Burgess (Philosophical Logic [2009], Pref) | |
| A reaction: He firmly distinguishes it from 'philosophy of logic', but doesn't spell it out. I take it that philosophical logic concerns metaprinciples which compare logical systems, and suggest new lines of research. Philosophy of logic seems more like metaphysics. |
| 15407 | Formalising arguments favours lots of connectives; proving things favours having very few [Burgess] |
| Full Idea: When formalising arguments it is convenient to have as many connectives as possible available.; but when proving results about formulas it is convenient to have as few as possible. | |
| From: John P. Burgess (Philosophical Logic [2009], 1.4) | |
| A reaction: Illuminating. The fact that you can whittle classical logic down to two (or even fewer!) connectives warms the heart of technicians, but makes connection to real life much more difficult. Hence a bunch of extras get added. |
| 15424 | Asserting a disjunction from one disjunct seems odd, but can be sensible, and needed in maths [Burgess] |
| Full Idea: Gricean implicature theory might suggest that a disjunction is never assertable when a disjunct is (though actually the disjunction might be 'pertinent') - but the procedure is indispensable in mathematical practice. | |
| From: John P. Burgess (Philosophical Logic [2009], 5.2) | |
| A reaction: He gives an example of a proof in maths which needs it, and an unusual conversational occasion where it makes sense. |
| 15409 | All occurrences of variables in atomic formulas are free [Burgess] |
| Full Idea: All occurrences of variables in atomic formulas are free. | |
| From: John P. Burgess (Philosophical Logic [2009], 1.7) |
| 15414 | The denotation of a definite description is flexible, rather than rigid [Burgess] |
| Full Idea: By contrast to rigidly designating proper names, …the denotation of definite descriptions is (in general) not rigid but flexible. | |
| From: John P. Burgess (Philosophical Logic [2009], 2.9) | |
| A reaction: This modern way of putting it greatly clarifies why Russell was interested in the type of reference involved in definite descriptions. Obviously some descriptions (such as 'the only person who could ever have…') might be rigid. |
| 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. |
| 15406 | 'Induction' and 'recursion' on complexity prove by connecting a formula to its atomic components [Burgess] |
| Full Idea: There are atomic formulas, and formulas built from the connectives, and that is all. We show that all formulas have some property, first for the atomics, then the others. This proof is 'induction on complexity'; we also use 'recursion on complexity'. | |
| From: John P. Burgess (Philosophical Logic [2009], 1.4) | |
| A reaction: That is: 'induction on complexity' builds a proof from atomics, via connectives; 'recursion on complexity' breaks down to the atomics, also via the connectives. You prove something by showing it is rooted in simple truths. |
| 15426 | We can build one expanding sequence, instead of a chain of deductions [Burgess] |
| Full Idea: Instead of demonstrations which are either axioms, or follow from axioms by rules, we can have one ever-growing sequence of formulas of the form 'Axioms |- ______', where the blank is filled by Axioms, then Lemmas, then Theorems, then Corollaries. | |
| From: John P. Burgess (Philosophical Logic [2009], 5.3) |
| 15425 | The sequent calculus makes it possible to have proof without transitivity of entailment [Burgess] |
| Full Idea: It might be wondered how one could have any kind of proof procedure at all if transitivity of entailment is disallowed, but the sequent calculus can get around the difficulty. | |
| From: John P. Burgess (Philosophical Logic [2009], 5.3) | |
| A reaction: He gives examples where transitivity of entailment (so that you can build endless chains of deductions) might fail. This is the point of the 'cut free' version of sequent calculus, since the cut rule allows transitivity. |
| 15408 | 'Tautologies' are valid formulas of classical sentential logic - or substitution instances in other logics [Burgess] |
| Full Idea: The valid formulas of classical sentential logic are called 'tautologically valid', or simply 'tautologies'; with other logics 'tautologies' are formulas that are substitution instances of valid formulas of classical sentential logic. | |
| From: John P. Burgess (Philosophical Logic [2009], 1.5) |
| 15418 | Validity (for truth) and demonstrability (for proof) have correlates in satisfiability and consistency [Burgess] |
| Full Idea: Validity (truth by virtue of logical form alone) and demonstrability (provability by virtue of logical form alone) have correlative notions of logical possibility, 'satisfiability' and 'consistency', which come apart in some logics. | |
| From: John P. Burgess (Philosophical Logic [2009], 3.3) |
| 15412 | Models leave out meaning, and just focus on truth values [Burgess] |
| Full Idea: Models generally deliberately leave out meaning, retaining only what is important for the determination of truth values. | |
| From: John P. Burgess (Philosophical Logic [2009], 2.2) | |
| A reaction: This is the key point to hang on to, if you are to avoid confusing mathematical models with models of things in the real world. |
| 15411 | We only need to study mathematical models, since all other models are isomorphic to these [Burgess] |
| Full Idea: In practice there is no need to consider any but mathematical models, models whose universes consist of mathematical objects, since every model is isomorphic to one of these. | |
| From: John P. Burgess (Philosophical Logic [2009], 1.8) | |
| A reaction: The crucial link is the technique of Gödel Numbering, which can translate any verbal formula into numerical form. He adds that, because of the Löwenheim-Skolem theorem only subsets of the natural numbers need be considered. |
| 15416 | We aim to get the technical notion of truth in all models matching intuitive truth in all instances [Burgess] |
| Full Idea: The aim in setting up a model theory is that the technical notion of truth in all models should agree with the intuitive notion of truth in all instances. A model is supposed to represent everything about an instance that matters for its truth. | |
| From: John P. Burgess (Philosophical Logic [2009], 3.2) |
| 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). |
| 15428 | The Liar seems like a truth-value 'gap', but dialethists see it as a 'glut' [Burgess] |
| Full Idea: It is a common view that the liar sentence ('This very sentence is not true') is an instance of a truth-value gap (neither true nor false), but some dialethists cite it as an example of a truth-value glut (both true and false). | |
| From: John P. Burgess (Philosophical Logic [2009], 5.7) | |
| A reaction: The defence of the glut view must be that it is true, then it is false, then it is true... Could it manage both at once? |
| 17423 | The essence of natural numbers must reflect all the functions they perform [Sicha] |
| Full Idea: What is really essential to being a natural number is what is common to the natural numbers in all the functions they perform. | |
| From: Jeffrey H. Sicha (Counting and the Natural Numbers [1968], 2) | |
| A reaction: I could try using natural numbers as insults. 'You despicable seven!' 'How dare you!' I actually agree. The question about functions is always 'what is it about this thing that enables it to perform this function'. |
| 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) |
| 17425 | To know how many, you need a numerical quantifier, as well as equinumerosity [Sicha] |
| Full Idea: A knowledge of 'how many' cannot be inferred from the equinumerosity of two collections; a numerical quantifier statement is needed. | |
| From: Jeffrey H. Sicha (Counting and the Natural Numbers [1968], 3) |
| 17424 | Counting puts an initial segment of a serial ordering 1-1 with some other entities [Sicha] |
| Full Idea: Counting is the activity of putting an initial segment of a serially ordered string in 1-1 correspondence with some other collection of entities. | |
| From: Jeffrey H. Sicha (Counting and the Natural Numbers [1968], 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) |
| 10185 | Set theory is the standard background for modern mathematics [Burgess] |
| Full Idea: In present-day mathematics, it is set theory that serves as the background theory in which other branches of mathematics are developed. | |
| From: John P. Burgess (Review of Chihara 'Struct. Accnt of Maths' [2005], §1) | |
| A reaction: [He cites Bourbaki as an authority for this] See Benacerraf for a famous difficulty here, when you actually try to derive an ontology from the mathematicians' working practices. |
| 10184 | Structuralists take the name 'R' of the reals to be a variable ranging over structures, not a structure [Burgess] |
| Full Idea: On the structuralist interpretation, theorems of analysis concerning the real numbers R are about all complete ordered fields. So R, which appears to be the name of a specific structure, is taken to be a variable ranging over structures. | |
| From: John P. Burgess (Review of Chihara 'Struct. Accnt of Maths' [2005], §1) | |
| A reaction: Since I am beginning to think that nearly all linguistic expressions should be understood as variables, I find this very appealing, even if Burgess hates it. Terms slide and drift, and are vague, between variable and determinate reference. |
| 10189 | There is no one relation for the real number 2, as relations differ in different models [Burgess] |
| Full Idea: One might meet the 'Van Inwagen Problem' by saying that the intrinsic properties of the object playing the role of 2 will differ from one model to another, so that no statement about the intrinsic properties of 'the' real numbers will make sense. | |
| From: John P. Burgess (Review of Chihara 'Struct. Accnt of Maths' [2005], §5) | |
| A reaction: There seems to be a potential confusion among opponents of structuralism between relations at the level of actual mathematical operations, and generalisations about relations, which are captured in the word 'patterns'. Call them 'meta-relations'? |
| 10186 | If set theory is used to define 'structure', we can't define set theory structurally [Burgess] |
| Full Idea: It is to set theory that one turns for the very definition of 'structure', ...and this creates a problem of circularity if we try to impose a structuralist interpretation on set theory. | |
| From: John P. Burgess (Review of Chihara 'Struct. Accnt of Maths' [2005], §1) | |
| A reaction: This seems like a nice difficulty, especially if, like Shapiro, you wade in and try to give a formal account of structures and patterns. Resnik is more circumspect and vague. |
| 10187 | Abstract algebra concerns relations between models, not common features of all the models [Burgess] |
| Full Idea: Abstract algebra, such as group theory, is not concerned with the features common to all models of the axioms, but rather with the relationships among different models of those axioms (especially homomorphic relation functions). | |
| From: John P. Burgess (Review of Chihara 'Struct. Accnt of Maths' [2005], §1) | |
| A reaction: It doesn't seem to follow that structuralism can't be about the relations (or patterns) found when abstracting away and overviewing all the models. One can study family relations, or one can study kinship in general. |
| 10188 | How can mathematical relations be either internal, or external, or intrinsic? [Burgess] |
| Full Idea: The 'Van Inwagen Problem' for structuralism is of explaining how a mathematical relation (such as set membership, or the ratios of an ellipse) can fit into one of the three scholastics types of relations: are they internal, external, or intrinsic? | |
| From: John P. Burgess (Review of Chihara 'Struct. Accnt of Maths' [2005], §5) | |
| A reaction: The difficulty is that mathematical objects seem to need intrinsic properties to get any of these three versions off the ground (which was Russell's complaint against structures). |
| 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). |
| 15420 | De re modality seems to apply to objects a concept intended for sentences [Burgess] |
| Full Idea: There is a problem over 'de re' modality (as contrasted with 'de dicto'), as in ∃x□x. What is meant by '"it is analytic that Px" is satisfied by a', given that analyticity is a notion that in the first instance applies to complete sentences? | |
| From: John P. Burgess (Philosophical Logic [2009], 3.9) | |
| A reaction: This is Burgess's summary of one of Quine's original objections. The issue may be a distinction between whether the sentence is analytic, and what makes it analytic. The necessity of bachelors being unmarried makes that sentence analytic. |
| 15419 | General consensus is S5 for logical modality of validity, and S4 for proof [Burgess] |
| Full Idea: To the extent that there is any conventional wisdom about the question, it is that S5 is correct for alethic logical modality, and S4 correct for apodictic logical modality. | |
| From: John P. Burgess (Philosophical Logic [2009], 3.8) | |
| A reaction: In classical logic these coincide, so presumably one should use the minimum system to do the job, which is S4 (?). |
| 15417 | Logical necessity has two sides - validity and demonstrability - which coincide in classical logic [Burgess] |
| Full Idea: Logical necessity is a genus with two species. For classical logic the truth-related notion of validity and the proof-related notion of demonstrability, coincide - but they are distinct concept. In some logics they come apart, in intension and extension. | |
| From: John P. Burgess (Philosophical Logic [2009], 3.3) | |
| A reaction: They coincide in classical logic because it is sound and complete. This strikes me as the correct approach to logical necessity, tying it to the actual nature of logic, rather than some handwavy notion of just 'true in all possible worlds'. |
| 15422 | Three conditionals theories: Materialism (material conditional), Idealism (true=assertable), Nihilism (no truth) [Burgess] |
| Full Idea: Three main theories of the truth of indicative conditionals are Materialism (the conditions are the same as for the material conditional), Idealism (identifying assertability with truth-value), and Nihilism (no truth, just assertability). | |
| From: John P. Burgess (Philosophical Logic [2009], 4.3) |
| 15423 | It is doubtful whether the negation of a conditional has any clear meaning [Burgess] |
| Full Idea: It is contentious whether conditionals have negations, and whether 'it is not the case that if A,B' has any clear meaning. | |
| From: John P. Burgess (Philosophical Logic [2009], 4.9) | |
| A reaction: This seems to be connected to Lewis's proof that a probability conditional cannot be reduced to a single proposition. If a conditional only applies to A-worlds, it is not surprising that its meaning gets lost when it leaves that world. |