47 ideas
| 8188 | Davidson takes truth to attach to individual sentences [Davidson, by Dummett] |
| Full Idea: Davidson, by contrast to Frege, has taken truth as attaching to linguistic items, that is, to actual or hypothetical token sentences. | |
| From: report of Donald Davidson (True to the Facts [1969]) by Michael Dummett - Truth and the Past 1 | |
| A reaction: My personal notion of truth is potentially applicable to animals, so this doesn't appeal to me. I am happy to think of animals as believing simple propositions that never get as far as language, and being right or wrong about them. |
| 10170 | While true-in-a-model seems relative, true-in-all-models seems not to be [Reck/Price] |
| Full Idea: While truth can be defined in a relative way, as truth in one particular model, a non-relative notion of truth is implied, as truth in all models. | |
| From: E Reck / M Price (Structures and Structuralism in Phil of Maths [2000], §4) | |
| A reaction: [The article is actually discussing arithmetic] This idea strikes me as extremely important. True-in-all-models is usually taken to be tautological, but it does seem to give a more universal notion of truth. See semantic truth, Tarski, Davidson etc etc. |
| 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) |
| 10166 | ZFC set theory has only 'pure' sets, without 'urelements' [Reck/Price] |
| Full Idea: In standard ZFC ('Zermelo-Fraenkel with Choice') set theory we deal merely with pure sets, not with additional urelements. | |
| From: E Reck / M Price (Structures and Structuralism in Phil of Maths [2000], §2) | |
| A reaction: The 'urelements' would the actual objects that are members of the sets, be they physical or abstract. This idea is crucial to understanding philosophy of mathematics, and especially logicism. Must the sets exist, just as the urelements do? |
| 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. |
| 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. |
| 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. |
| 10175 | Three types of variable in second-order logic, for objects, functions, and predicates/sets [Reck/Price] |
| Full Idea: In second-order logic there are three kinds of variables, for objects, for functions, and for predicates or sets. | |
| From: E Reck / M Price (Structures and Structuralism in Phil of Maths [2000], §5) | |
| A reaction: It is interesting that a predicate seems to be the same as a set, which begs rather a lot of questions. For those who dislike second-order logic, there seems nothing instrinsically wicked in having variables ranging over innumerable multi-order types. |
| 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. |
| 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. |
| 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) |
| 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) |
| 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? |
| 10165 | 'Analysis' is the theory of the real numbers [Reck/Price] |
| Full Idea: 'Analysis' is the theory of the real numbers. | |
| From: E Reck / M Price (Structures and Structuralism in Phil of Maths [2000], §2) | |
| A reaction: 'Analysis' began with the infinitesimal calculus, which later built on the concept of 'limit'. A continuum of numbers seems to be required to make that work. |
| 10174 | Mereological arithmetic needs infinite objects, and function definitions [Reck/Price] |
| Full Idea: The difficulties for a nominalistic mereological approach to arithmetic is that an infinity of physical objects are needed (space-time points? strokes?), and it must define functions, such as 'successor'. | |
| From: E Reck / M Price (Structures and Structuralism in Phil of Maths [2000], §4) | |
| A reaction: Many ontologically austere accounts of arithmetic are faced with the problem of infinity. The obvious non-platonist response seems to be a modal or if-then approach. To postulate infinite abstract or physical entities so that we can add 3 and 2 is mad. |
| 10164 | Peano Arithmetic can have three second-order axioms, plus '1' and 'successor' [Reck/Price] |
| Full Idea: A common formulation of Peano Arithmetic uses 2nd-order logic, the constant '1', and a one-place function 's' ('successor'). Three axioms then give '1 is not a successor', 'different numbers have different successors', and induction. | |
| From: E Reck / M Price (Structures and Structuralism in Phil of Maths [2000], §2) | |
| A reaction: This is 'second-order' Peano Arithmetic, though it is at least as common to formulate in first-order terms (only quantifying over objects, not over properties - as is done here in the induction axiom). I like the use of '1' as basic instead of '0'! |
| 10172 | Set-theory gives a unified and an explicit basis for mathematics [Reck/Price] |
| Full Idea: The merits of basing an account of mathematics on set theory are that it allows for a comprehensive unified treatment of many otherwise separate branches of mathematics, and that all assumption, including existence, are explicit in the axioms. | |
| From: E Reck / M Price (Structures and Structuralism in Phil of Maths [2000], §4) | |
| A reaction: I am forming the impression that set-theory provides one rather good model (maybe the best available) for mathematics, but that doesn't mean that mathematics is set-theory. The best map of a landscape isn't a landscape. |
| 10167 | Structuralism emerged from abstract algebra, axioms, and set theory and its structures [Reck/Price] |
| Full Idea: Structuralism has emerged from the development of abstract algebra (such as group theory), the creation of axiom systems, the introduction of set theory, and Bourbaki's encyclopaedic survey of set theoretic structures. | |
| From: E Reck / M Price (Structures and Structuralism in Phil of Maths [2000], §2) | |
| A reaction: In other words, mathematics has gradually risen from one level of abstraction to the next, so that mathematical entities like points and numbers receive less and less attention, with relationships becoming more prominent. |
| 10169 | Relativist Structuralism just stipulates one successful model as its arithmetic [Reck/Price] |
| Full Idea: Relativist Structuralism simply picks one particular model of axiomatised arithmetic (i.e. one particular interpretation that satisfies the axioms), and then stipulates what the elements, functions and quantifiers refer to. | |
| From: E Reck / M Price (Structures and Structuralism in Phil of Maths [2000], §4) | |
| A reaction: The point is that a successful model can be offered, and it doesn't matter which one, like having any sort of aeroplane, as long as it flies. I don't find this approach congenial, though having a model is good. What is the essence of flight? |
| 10179 | There are 'particular' structures, and 'universal' structures (what the former have in common) [Reck/Price] |
| Full Idea: The term 'structure' has two uses in the literature, what can be called 'particular structures' (which are particular relational systems), but also what can be called 'universal structures' - what particular systems share, or what they instantiate. | |
| From: E Reck / M Price (Structures and Structuralism in Phil of Maths [2000], §6) | |
| A reaction: This is a very helpful distinction, because it clarifies why (rather to my surprise) some structuralists turn out to be platonists in a new guise. Personal my interest in structuralism has been anti-platonist from the start. |
| 10181 | Pattern Structuralism studies what isomorphic arithmetic models have in common [Reck/Price] |
| Full Idea: According to 'pattern' structuralism, what we study are not the various particular isomorphic models of arithmetic, but something in addition to them: a corresponding pattern. | |
| From: E Reck / M Price (Structures and Structuralism in Phil of Maths [2000], §7) | |
| A reaction: Put like that, we have to feel a temptation to wield Ockham's Razor. It's bad enough trying to give the structure of all the isomorphic models, without seeking an even more abstract account of underlying patterns. But patterns connect to minds.. |
| 10182 | There are Formalist, Relativist, Universalist and Pattern structuralism [Reck/Price] |
| Full Idea: There are four main variants of structuralism in the philosophy of mathematics - formalist structuralism, relativist structuralism, universalist structuralism (with modal variants), and pattern structuralism. | |
| From: E Reck / M Price (Structures and Structuralism in Phil of Maths [2000], §9) | |
| A reaction: I'm not sure where Chihara's later book fits into this, though it is at the nominalist end of the spectrum. Shapiro and Resnik do patterns (the latter more loosely); Hellman does modal universalism; Quine does the relativist version. Dedekind? |
| 10168 | Formalist Structuralism says the ontology is vacuous, or formal, or inference relations [Reck/Price] |
| Full Idea: Formalist Structuralism endorses structural methodology in mathematics, but rejects semantic and metaphysical problems as either meaningless, or purely formal, or as inference relations. | |
| From: E Reck / M Price (Structures and Structuralism in Phil of Maths [2000], §3) | |
| A reaction: [very compressed] I find the third option fairly congenial, certainly in preference to rather platonist accounts of structuralism. One still needs to distinguish the mathematical from the non-mathematical in the inference relations. |
| 10178 | Maybe we should talk of an infinity of 'possible' objects, to avoid arithmetic being vacuous [Reck/Price] |
| Full Idea: It is tempting to take a modal turn, and quantify over all possible objects, because if there are only a finite number of actual objects, then there are no models (of the right sort) for Peano Arithmetic, and arithmetic is vacuously true. | |
| From: E Reck / M Price (Structures and Structuralism in Phil of Maths [2000], §5) | |
| A reaction: [compressed; Geoffrey Hellman is the chief champion of this view] The article asks whether we are not still left with the puzzle of whether infinitely many objects are possible, instead of existent. |
| 10176 | Universalist Structuralism is based on generalised if-then claims, not one particular model [Reck/Price] |
| Full Idea: Universalist Structuralism is a semantic thesis, that an arithmetical statement asserts a universal if-then statement. We build an if-then statement (using quantifiers) into the structure, and we generalise away from any one particular model. | |
| From: E Reck / M Price (Structures and Structuralism in Phil of Maths [2000], §5) | |
| A reaction: There remains the question of what is distinctively mathematical about the highly generalised network of inferences that is being described. Presumable the axioms capture that, but why those particular axioms? Russell is cited as an originator. |
| 10177 | Universalist Structuralism eliminates the base element, as a variable, which is then quantified out [Reck/Price] |
| Full Idea: Universalist Structuralism is eliminativist about abstract objects, in a distinctive form. Instead of treating the base element (say '1') as an ambiguous referring expression (the Relativist approach), it is a variable which is quantified out. | |
| From: E Reck / M Price (Structures and Structuralism in Phil of Maths [2000], §5) | |
| A reaction: I am a temperamental eliminativist on this front (and most others) so this is tempting. I am also in love with the concept of a 'variable', which I take to be utterly fundamental to all conceptual thought, even in animals, and not just a trick of algebra. |
| 10171 | The existence of an infinite set is assumed by Relativist Structuralism [Reck/Price] |
| Full Idea: Relativist Structuralism must first assume the existence of an infinite set, otherwise there would be no model to pick, and arithmetical terms would have no reference. | |
| From: E Reck / M Price (Structures and Structuralism in Phil of Maths [2000], §4) | |
| A reaction: See Idea 10169 for Relativist Structuralism. They point out that ZFC has an Axiom of Infinity. |
| 10173 | A nominalist might avoid abstract objects by just appealing to mereological sums [Reck/Price] |
| Full Idea: One way for a nominalist to reject appeal to all abstract objects, including sets, is to only appeal to nominalistically acceptable objects, including mereological sums. | |
| From: E Reck / M Price (Structures and Structuralism in Phil of Maths [2000], §4) | |
| A reaction: I'm suddenly thinking that this looks very interesting and might be the way to go. The issue seems to be whether mereological sums should be seen as constrained by nature, or whether they are unrestricted. See Mereology in Ontology...|Intrinsic Identity. |
| 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. |