display all the ideas for this combination of philosophers
12 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) |
| 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. |
| 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. |
| 6007 | If you know your father, but don't recognise your father veiled, you know and don't know the same person [Eubulides, by Dancy,R] |
| Full Idea: The 'undetected' or 'veiled' paradox of Eubulides says: if you know your father, and don't know the veiled person before you, but that person is your father, you both know and don't know the same person. | |
| From: report of Eubulides (fragments/reports [c.390 BCE]) by R.M. Dancy - Megarian School | |
| A reaction: Essentially an uninteresting equivocation on two senses of "know", but this paradox comes into its own when we try to give an account of how linguistic reference works. Frege's distinction of sense and reference tried to sort it out (Idea 4976). |
| 6006 | If you say truly that you are lying, you are lying [Eubulides, by Dancy,R] |
| Full Idea: The liar paradox of Eubulides says 'if you state that you are lying, and state the truth, then you are lying'. | |
| From: report of Eubulides (fragments/reports [c.390 BCE]) by R.M. Dancy - Megarian School | |
| A reaction: (also Cic. Acad. 2.95) Don't say it, then. These kind of paradoxes of self-reference eventually lead to Russell's 'barber' paradox and his Theory of Types. |
| 6008 | Removing one grain doesn't destroy a heap, so a heap can't be destroyed [Eubulides, by Dancy,R] |
| Full Idea: The 'sorites' paradox of Eubulides says: if you take one grain of sand from a heap (soros), what is left is still a heap; so no matter how many grains of sand you take one by one, the result is always a heap. | |
| From: report of Eubulides (fragments/reports [c.390 BCE]) by R.M. Dancy - Megarian School | |
| A reaction: (also Cic. Acad. 2.49) This is a very nice paradox, which goes to the heart of our bewilderment when we try to fully understand reality. It homes in on problems of identity, as best exemplified in the Ship of Theseus (Ideas 1212 + 1213). |