display all the ideas for this combination of philosophers
26 ideas
| 14980 | There is a real issue over what is the 'correct' logic [Sider] |
| Full Idea: Certain debates over the 'correct' logic are genuine, and not linguistic or conceptual. | |
| From: Theodore Sider (Writing the Book of the World [2011], 01.3) | |
| A reaction: It is rather hard to give arguments in favour of this view, but I am pleased to have the authority of Sider with me. |
| 15000 | 'It is raining' and 'it is not raining' can't be legislated, so we can't legislate 'p or ¬p' [Sider] |
| Full Idea: I cannot legislate-true 'It is raining' and I cannot legislate true 'It is not raining', so if I cannot legislate either true then I cannot legislate-true the disjunction 'it is raining or it is not raining'. | |
| From: Theodore Sider (Writing the Book of the World [2011], 06.5) | |
| A reaction: This strikes me as a very simple and very persuasive argument against the idea that logic is a mere convention. I take disjunction to be an abstract summary of how the world works. Sider seems sympathetic. |
| 15020 | Classical logic is good for mathematics and science, but less good for natural language [Sider] |
| Full Idea: Despite its brilliant success in mathematics and fundamental science, classical logic applies uneasily to natural language. | |
| From: Theodore Sider (Writing the Book of the World [2011], 10.6) | |
| A reaction: He gives examples of the conditional, and debates over the meaning of 'and', 'or' and 'not', and also names and quantifiers. Many modern philosophical problems result from this conflict. |
| 13678 | The most popular account of logical consequence is the semantic or model-theoretic one [Sider] |
| Full Idea: On the question of the nature of genuine logical consequence, ...the most popular answer is the semantic, or model-theoretic one. | |
| From: Theodore Sider (Logic for Philosophy [2010], 1.5) | |
| A reaction: Reading the literature, one might be tempted to think that this is the only account that anyone takes seriously. Substitutional semantics seems an interesting alternative. |
| 13679 | Maybe logical consequence is more a matter of provability than of truth-preservation [Sider] |
| Full Idea: Another answer to the question about the nature of logical consequence is a proof-theoretic one, according to which it is more a matter of provability than of truth-preservation. | |
| From: Theodore Sider (Logic for Philosophy [2010], 1.5) | |
| A reaction: I don't like this, and prefer the model-theoretic or substitutional accounts. Whether you can prove that something is a logical consequence seems to me entirely separate from whether you can see that it is so. Gödel seems to agree. |
| 13682 | Maybe logical consequence is impossibility of the premises being true and the consequent false [Sider] |
| Full Idea: The 'modal' account of logical consequence is that it is not possible for the premises to be true and the consequent false (under some suitable notion of possibility). | |
| From: Theodore Sider (Logic for Philosophy [2010], 1.5) | |
| A reaction: Sider gives a nice summary of five views of logical consequence, to which Shapiro adds substitutional semantics. |
| 13680 | Maybe logical consequence is a primitive notion [Sider] |
| Full Idea: There is a 'primitivist' account, according to which logical consequence is a primitive notion. | |
| From: Theodore Sider (Logic for Philosophy [2010], 1.5) | |
| A reaction: While sympathetic to substitutional views (Idea 13674), the suggestion here pushes me towards thinking that truth must be at the root of it. The trouble, though, is that a falsehood can be a good logical consequence of other falsehoods. |
| 15029 | Modal accounts of logical consequence are simple necessity, or essential use of logical words [Sider] |
| Full Idea: The simplest modal account is that logical consequence is just necessary consequence; another modal account says that logical consequences are modal consequences that involve only logical words essentially. | |
| From: Theodore Sider (Writing the Book of the World [2011], 12.3) | |
| A reaction: [He cites Quine's 'Carnap and Logical Truth' for the second idea] Sider is asserting that Humeans like him dislike modality, and hence need a nonmodal account of logical consequence. |
| 13722 | A 'theorem' is an axiom, or the last line of a legitimate proof [Sider] |
| Full Idea: A 'theorem' is defined as the last line of a proof in which each line is either an axiom or follows from earlier lines by a rule. | |
| From: Theodore Sider (Logic for Philosophy [2010], 9.7) | |
| A reaction: In other words, theorems are the axioms and their implications. |
| 15019 | Define logical constants by role in proofs, or as fixed in meaning, or as topic-neutral [Sider] |
| Full Idea: Some say that logical constants are those expressions that are defined by their proof-theoretic roles, others that they are the expressions whose semantic values are permutation-invariant, and still others that they are the topic-neutral expressions. | |
| From: Theodore Sider (Writing the Book of the World [2011], 10.3) | |
| A reaction: [He cites MacFarlane 2005 as giving a survey of this] |
| 13696 | When a variable is 'free' of the quantifier, the result seems incapable of truth or falsity [Sider] |
| Full Idea: When a variable is not combined with a quantifier (and so is 'free'), the result is, intuitively, semantically incomplete, and incapable of truth or falsity. | |
| From: Theodore Sider (Logic for Philosophy [2010], 4.2) |
| 13700 | A 'total' function must always produce an output for a given domain [Sider] |
| Full Idea: Calling a function a 'total' function 'over D' means that the function must have a well-defined output (which is a member of D) whenever it is given as inputs any n members of D. | |
| From: Theodore Sider (Logic for Philosophy [2010], 5.2) |
| 13703 | λ can treat 'is cold and hungry' as a single predicate [Sider] |
| Full Idea: We might prefer λx(Fx∧Gx)(a) as the symbolization of 'John is cold and hungry', since it treats 'is cold and hungry' as a single predicate. | |
| From: Theodore Sider (Logic for Philosophy [2010], 5.5) |
| 13688 | Good axioms should be indisputable logical truths [Sider] |
| Full Idea: Since they are the foundations on which a proof rests, the axioms in a good axiomatic system ought to represent indisputable logical truths. | |
| From: Theodore Sider (Logic for Philosophy [2010], 2.6) |
| 13687 | No assumptions in axiomatic proofs, so no conditional proof or reductio [Sider] |
| Full Idea: Axiomatic systems do not allow reasoning with assumptions, and therefore do not allow conditional proof or reductio ad absurdum. | |
| From: Theodore Sider (Logic for Philosophy [2010], 2.6) | |
| A reaction: Since these are two of the most basic techniques of proof which I have learned (in Lemmon), I shall avoid axiomatic proof systems at all costs, despites their foundational and Ockhamist appeal. |
| 13690 | Proof by induction 'on the length of the formula' deconstructs a formula into its accepted atoms [Sider] |
| Full Idea: The style of proof called 'induction on formula construction' (or 'on the number of connectives', or 'on the length of the formula') rest on the fact that all formulas are built up from atomic formulas according to strict rules. | |
| From: Theodore Sider (Logic for Philosophy [2010], 2.7) | |
| A reaction: Hence the proof deconstructs the formula, and takes it back to a set of atomic formulas have already been established. |
| 13691 | Induction has a 'base case', then an 'inductive hypothesis', and then the 'inductive step' [Sider] |
| Full Idea: A proof by induction starts with a 'base case', usually that an atomic formula has some property. It then assumes an 'inductive hypothesis', that the property is true up to a certain case. The 'inductive step' then says it will be true for the next case. | |
| From: Theodore Sider (Logic for Philosophy [2010], 2.7) | |
| A reaction: [compressed] |
| 15001 | 'Tonk' is supposed to follow the elimination and introduction rules, but it can't be so interpreted [Sider] |
| Full Idea: 'Tonk' is stipulated by Prior to stand for a meaning that obeys the elimination and introduction rules; but there simply is no such meaning; 'tonk' cannot be interpreted so as to obey the rules. | |
| From: Theodore Sider (Writing the Book of the World [2011], 06.5) | |
| A reaction: 'Tonk' thus seems to present a problem for so-called 'natural' deduction, if the natural deduction consists of nothing more than obey elimination and introduction rules. |
| 13685 | Natural deduction helpfully allows reasoning with assumptions [Sider] |
| Full Idea: The method of natural deduction is popular in introductory textbooks since it allows reasoning with assumptions. | |
| From: Theodore Sider (Logic for Philosophy [2010], 2.5) | |
| A reaction: Reasoning with assumptions is generally easier, rather than being narrowly confined to a few tricky axioms, You gradually show that an inference holds whatever the assumption was, and so end up with the same result. |
| 13686 | We can build proofs just from conclusions, rather than from plain formulae [Sider] |
| Full Idea: We can construct proofs not out of well-formed formulae ('wffs'), but out of sequents, which are some premises followed by their logical consequence. We explicitly keep track of the assumptions upon which the conclusion depends. | |
| From: Theodore Sider (Logic for Philosophy [2010], 2.5.1) | |
| A reaction: He says the method of sequents was invented by Gerhard Gentzen (the great nazi logician) in 1935. The typical starting sequents are the introduction and elimination rules. E.J. Lemmon's book, used in this database, is an example. |
| 13697 | Valuations in PC assign truth values to formulas relative to variable assignments [Sider] |
| Full Idea: A valuation function in predicate logic will assign truth values to formulas relative to variable assignments. | |
| From: Theodore Sider (Logic for Philosophy [2010], 4.2) | |
| A reaction: Sider observes that this is a 'double' relativisation (due to Tarski), since propositional logic truth was already relative to an interpretation. Now we are relative to variable assignments as well. |
| 13684 | The semantical notion of a logical truth is validity, being true in all interpretations [Sider] |
| Full Idea: The semantical notion of a logical truth is that of a valid formula, which is true in all interpretations. In propositional logic they are 'tautologies'. | |
| From: Theodore Sider (Logic for Philosophy [2010], 2.3) | |
| A reaction: This implies that there is a proof-theoretic account of logical truth as well. Intuitively a logical truth is a sequent which holds no matter which subject matter it refers to, so the semantic view sounds OK. |
| 13704 | It is hard to say which are the logical truths in modal logic, especially for iterated modal operators [Sider] |
| Full Idea: It isn't clear which formulas of modal propositional logic are logical truths, ...especially for sentences that contain iterations of modal operators. Is □P→□□P a logical truth? It's hard to say. | |
| From: Theodore Sider (Logic for Philosophy [2010], 6.3) | |
| A reaction: The result, of course, is that there are numerous 'systems' for modal logic, so that you can choose the one that gives you the logical truths you want. His example is valid in S4 and S5, but not in the others. |
| 13724 | In model theory, first define truth, then validity as truth in all models, and consequence as truth-preservation [Sider] |
| Full Idea: In model theory one normally defines some notion of truth in a model, and then uses it to define validity as truth in all models, and semantic consequence as the preservation of truth in models. | |
| From: Theodore Sider (Logic for Philosophy [2010], 10.1) |
| 13698 | In a complete logic you can avoid axiomatic proofs, by using models to show consequences [Sider] |
| Full Idea: You can establish facts of the form Γ|-φ while avoiding the agonies of axiomatic proofs by reasoning directly about models to conclusions about semantic consequence, and then citing completeness. | |
| From: Theodore Sider (Logic for Philosophy [2010], 4.5) | |
| A reaction: You cite completeness by saying that anything which you have shown to be a semantic consequence must therefore be provable (in some way). |
| 13699 | Compactness surprisingly says that no contradictions can emerge when the set goes infinite [Sider] |
| Full Idea: Compactness is intuitively surprising, ..because one might have thought there could be some contradiction latent within some infinite set, preventing it from being satisfiable, only discovered when you consider the whole set. But this can't happen. | |
| From: Theodore Sider (Logic for Philosophy [2010], 4.5) |