display all the ideas for this combination of texts
15 ideas
| 9722 | Inference not from content, but from the fact that it was said, is 'conversational implicature' [Enderton] |
| Full Idea: The process is dubbed 'conversational implicature' when the inference is not from the content of what has been said, but from the fact that it has been said. | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], 1.7.3) |
| 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. |
| 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. |
| 9718 | Validity is either semantic (what preserves truth), or proof-theoretic (following procedures) [Enderton] |
| Full Idea: The point of logic is to give an account of the notion of validity,..in two standard ways: the semantic way says that a valid inference preserves truth (symbol |=), and the proof-theoretic way is defined in terms of purely formal procedures (symbol |-). | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], 1.1.3..) | |
| A reaction: This division can be mirrored in mathematics, where it is either to do with counting or theorising about things in the physical world, or following sets of rules from axioms. Language can discuss reality, or play word-games. |
| 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] |
| 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. |
| 9721 | A logical truth or tautology is a logical consequence of the empty set [Enderton] |
| Full Idea: A is a logical truth (tautology) (|= A) iff it is a semantic consequence of the empty set of premises (φ |= A), that is, every interpretation makes A true. | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], 1.3.4) | |
| A reaction: So the final column of every line of the truth table will be T. |
| 9994 | A truth assignment to the components of a wff 'satisfy' it if the wff is then True [Enderton] |
| Full Idea: A truth assignment 'satisfies' a formula, or set of formulae, if it evaluates as True when all of its components have been assigned truth values. | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], 1.2) | |
| A reaction: [very roughly what Enderton says!] The concept becomes most significant when a large set of wff's is pronounced 'satisfied' after a truth assignment leads to them all being true. |
| 9719 | A proof theory is 'sound' if its valid inferences entail semantic validity [Enderton] |
| Full Idea: If every proof-theoretically valid inference is semantically valid (so that |- entails |=), the proof theory is said to be 'sound'. | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], 1.1.7) |
| 9720 | A proof theory is 'complete' if semantically valid inferences entail proof-theoretic validity [Enderton] |
| Full Idea: If every semantically valid inference is proof-theoretically valid (so that |= entails |-), the proof-theory is said to be 'complete'. | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], 1.1.7) |
| 9995 | Proof in finite subsets is sufficient for proof in an infinite set [Enderton] |
| Full Idea: If a wff is tautologically implied by a set of wff's, it is implied by a finite subset of them; and if every finite subset is satisfiable, then so is the whole set of wff's. | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], 2.5) | |
| A reaction: [Enderton's account is more symbolic] He adds that this also applies to models. It is a 'theorem' because it can be proved. It is a major theorem in logic, because it brings the infinite under control, and who doesn't want that? |
| 9996 | Expressions are 'decidable' if inclusion in them (or not) can be proved [Enderton] |
| Full Idea: A set of expressions is 'decidable' iff there exists an effective procedure (qv) that, given some expression, will decide whether or not the expression is included in the set (i.e. doesn't contradict it). | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], 1.7) | |
| A reaction: This is obviously a highly desirable feature for a really reliable system of expressions to possess. All finite sets are decidable, but some infinite sets are not. |
| 9997 | For a reasonable language, the set of valid wff's can always be enumerated [Enderton] |
| Full Idea: The Enumerability Theorem says that for a reasonable language, the set of valid wff's can be effectively enumerated. | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], 2.5) | |
| A reaction: There are criteria for what makes a 'reasonable' language (probably specified to ensure enumerability!). Predicates and functions must be decidable, and the language must be finite. |