display all the ideas for this combination of philosophers
23 ideas
| 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) |
| 18935 | Semantic theory should specify when an act of naming is successful [Sawyer] |
| Full Idea: A semantic theory of names should deliver a specification of the conditions under which a name names an individual, and hence a specification of the conditions under which a name is empty. | |
| From: Sarah Sawyer (Empty Names [2012], 1) | |
| A reaction: Naming can be private, like naming my car 'Bertrand', but never tell anyone. I like Plato's remark that names are 'tools'. Do we specify conditions for successful spanner-usage? The first step must be individuation, preparatory to naming. |
| 18945 | Millians say a name just means its object [Sawyer] |
| Full Idea: The Millian view of direct reference says that the meaning of a name is the object named. | |
| From: Sarah Sawyer (Empty Names [2012], 4) | |
| A reaction: Any theory that says meaning somehow is features of the physical world strikes me as totally misguided. Napoleon is a man, so he can't be part of a sentence. He delegates that job to words (such as 'Napoleon'). |
| 18934 | Sentences with empty names can be understood, be co-referential, and even be true [Sawyer] |
| Full Idea: Some empty names sentences can be understood, so appear to be meaningful ('Pegasus was sired by Poseidon'), ...some appear to be co-referential ('Santa Claus'/'Father Christmas'), and some appear to be straightforwardly true ('Pegasus doesn't exist'). | |
| From: Sarah Sawyer (Empty Names [2012], 1) | |
| A reaction: Hang on to this, when the logicians arrive and start telling you that your talk of empty names is vacuous, because there is no object in the 'domain' to which a predicate can be attached. Meaning, reference and truth are the issues around empty names. |
| 18938 | Frege's compositional account of truth-vaues makes 'Pegasus doesn't exist' neither true nor false [Sawyer] |
| Full Idea: In Frege's account sentences such as 'Pegasus does not exist' will be neither true nor false, since the truth-value of a sentence is its referent, and the referent of a complex expression is determined by the referent of its parts. | |
| From: Sarah Sawyer (Empty Names [2012], 2) | |
| A reaction: We can keep the idea of 'sense', which is very useful for dealing with empty names, but tweak his account of truth-values to evade this problem. I'm thinking that meaning is compositional, but truth-value isn't. |
| 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. |
| 18947 | Definites descriptions don't solve the empty names problem, because the properties may not exist [Sawyer] |
| Full Idea: If it were possible for a definite description to be empty - not in the sense of there being no object that satisfies it, but of there being no set of properties it refers to - the problem of empty names would not have been solved. | |
| From: Sarah Sawyer (Empty Names [2012], 5) | |
| A reaction: Swoyer is thinking of properties like 'is a unicorn', which are clearly just as vulnerable to being empty as 'the unicorn' was. It seems unlikely that 'horse', 'white' and 'horn' would be empty. |
| 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? |