53 ideas
| 8166 | Truth is part of semantics, since valid inference preserves truth [Dummett] |
| Full Idea: The concept of truth belongs to semantics, since after all truth is what must be preserved by a valid deductive inference. | |
| From: Michael Dummett (Thought and Reality [1997], 2) | |
| A reaction: Does this conclusion follow? Compare 'nice taste belongs to cooking, since that is what cooking must preserve'. I don't like this. I take 'truth' to be a relevant concept to a discussion of a dog's belief that it is going to be taken for a walk. |
| 9724 | Until the 1960s the only semantics was truth-tables [Enderton] |
| Full Idea: Until the 1960s standard truth-table semantics were the only ones that there were. | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], 1.10.1) | |
| A reaction: The 1960s presumably marked the advent of possible worlds. |
| 9703 | 'dom R' indicates the 'domain' of objects having a relation [Enderton] |
| Full Idea: 'dom R' indicates the 'domain' of a relation, that is, the set of all objects that are members of ordered pairs and that have that relation. | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], Ch.0) |
| 9705 | 'fld R' indicates the 'field' of all objects in the relation [Enderton] |
| Full Idea: 'fld R' indicates the 'field' of a relation, that is, the set of all objects that are members of ordered pairs on either side of the relation. | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], Ch.0) |
| 9704 | 'ran R' indicates the 'range' of objects being related to [Enderton] |
| Full Idea: 'ran R' indicates the 'range' of a relation, that is, the set of all objects that are members of ordered pairs and that are related to by the first objects. | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], Ch.0) |
| 9710 | We write F:A→B to indicate that A maps into B (the output of F on A is in B) [Enderton] |
| Full Idea: We write F : A → B to indicate that A maps into B, that is, the domain of relating things is set A, and the things related to are all in B. If we add that F = B, then A maps 'onto' B. | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], Ch.0) |
| 9707 | 'F(x)' is the unique value which F assumes for a value of x [Enderton] |
|
Full Idea:
F(x) is a 'function', which indicates the unique value which y takes in |
|
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], Ch.0) |
| 9712 | A relation is 'symmetric' on a set if every ordered pair has the relation in both directions [Enderton] |
| Full Idea: A relation is 'symmetric' on a set if every ordered pair in the set has the relation in both directions. | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], Ch.0) |
| 9713 | A relation is 'transitive' if it can be carried over from two ordered pairs to a third [Enderton] |
| Full Idea: A relation is 'transitive' on a set if the relation can be carried over from two ordered pairs to a third. | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], Ch.0) |
| 9699 | The 'powerset' of a set is all the subsets of a given set [Enderton] |
| Full Idea: The 'powerset' of a set is all the subsets of a given set. Thus: PA = {x : x ⊆ A}. | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], Ch.0) |
| 9700 | Two sets are 'disjoint' iff their intersection is empty [Enderton] |
| Full Idea: Two sets are 'disjoint' iff their intersection is empty (i.e. they have no members in common). | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], Ch.0) |
| 9702 | A 'domain' of a relation is the set of members of ordered pairs in the relation [Enderton] |
| Full Idea: The 'domain' of a relation is the set of all objects that are members of ordered pairs that are members of the relation. | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], Ch.0) |
| 9701 | A 'relation' is a set of ordered pairs [Enderton] |
| Full Idea: A 'relation' is a set of ordered pairs. The ordering relation on the numbers 0-3 is captured by - in fact it is - the set of ordered pairs {<0,1>,<0,2>,<0,3>,<1,2>,<1,3>,<2,3>}. | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], Ch.0) | |
| A reaction: This can't quite be a definition of order among numbers, since it relies on the notion of a 'ordered' pair. |
| 9706 | A 'function' is a relation in which each object is related to just one other object [Enderton] |
| Full Idea: A 'function' is a relation which is single-valued. That is, for each object, there is only one object in the function set to which that object is related. | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], Ch.0) |
| 9708 | A function 'maps A into B' if the relating things are set A, and the things related to are all in B [Enderton] |
| Full Idea: A function 'maps A into B' if the domain of relating things is set A, and the things related to are all in B. | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], Ch.0) |
| 9709 | A function 'maps A onto B' if the relating things are set A, and the things related to are set B [Enderton] |
| Full Idea: A function 'maps A onto B' if the domain of relating things is set A, and the things related to are set B. | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], Ch.0) |
| 9711 | A relation is 'reflexive' on a set if every member bears the relation to itself [Enderton] |
| Full Idea: A relation is 'reflexive' on a set if every member of the set bears the relation to itself. | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], Ch.0) |
| 9714 | A relation satisfies 'trichotomy' if all pairs are either relations, or contain identical objects [Enderton] |
| Full Idea: A relation satisfies 'trichotomy' on a set if every ordered pair is related (in either direction), or the objects are identical. | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], Ch.0) |
| 9717 | A set is 'dominated' by another if a one-to-one function maps the first set into a subset of the second [Enderton] |
| Full Idea: A set is 'dominated' by another if a one-to-one function maps the first set into a subset of the second. | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], Ch.0) |
| 9715 | An 'equivalence relation' is a reflexive, symmetric and transitive binary relation [Enderton] |
| Full Idea: An 'equivalence relation' is a binary relation which is reflexive, and symmetric, and transitive. | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], Ch.0) |
| 9716 | We 'partition' a set into distinct subsets, according to each relation on its objects [Enderton] |
| Full Idea: Equivalence classes will 'partition' a set. That is, it will divide it into distinct subsets, according to each relation on the set. | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], Ch.0) |
| 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. |
| 8173 | Language can violate bivalence because of non-referring terms or ill-defined predicates [Dummett] |
| Full Idea: Two features of natural languages cause them to violate bivalence: singular terms (or proper names) which have a sense but fail to denote an object ('the centre of the universe'); and predicates which are not well defined for every object. | |
| From: Michael Dummett (Thought and Reality [1997], 4) | |
| A reaction: If we switch from sentences to propositions these problems might be avoided. If there is no reference, or a vague predicate, then there is (maybe) just no proposition being expressed which could be evaluated for truth. |
| 8179 | The law of excluded middle is the logical reflection of the principle of bivalence [Dummett] |
| Full Idea: The law of excluded middle is the reflection, within logic, of the principle of bivalence. It states that 'For any statement A, the statement 'A or not-A' is true'. | |
| From: Michael Dummett (Thought and Reality [1997], 5) | |
| A reaction: True-or-not-true is an easier condition to fulfil than true-or-false. The second says that 'false' is the only alternative, but the first allows other alternatives to 'true' (such as 'undecidable'). It is hard to challenge excluded middle. Somewhat true? |
| 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. |
| 8184 | Philosophers should not presume reality, but only invoke it when language requires it [Dummett] |
| Full Idea: The philosopher's task is not to make a prior commitment for or against realism, but to discover how far realist considerations must be invoked in order to describe our understanding of our language: they may be invoked only if they must be invoked. | |
| From: Michael Dummett (Thought and Reality [1997], 6) | |
| A reaction: I don't see why the default position should be solipsism, or a commitment to Ockham's Razor. This is the Cartesian 'Enlightenment Project' approach to philosophy - that everything has to be proved. There is more to ontology than language. |
| 8185 | We can't make sense of a world not apprehended by a mind [Dummett] |
| Full Idea: We can make no clear sense of there being a world that is not apprehended by any mind. | |
| From: Michael Dummett (Thought and Reality [1997], 8) | |
| A reaction: I find Dummett's view quite baffling. It is no coincidence that Dummett is a theist, along (it seems) Berkeleian lines. I see no more problem with imagining such worlds than with imagining ships sunken long ago which will never be found. |
| 8163 | Since 'no bird here' and 'no squirrel here' seem the same, we must talk of 'atomic' facts [Dummett] |
| Full Idea: What complex of objects constitutes the fact that there is no bird on the bough, and how is that distinct from no squirrel on the bough? This drives us to see the world as composed of 'atomic' facts, making complexes into compounds, not reality itself. | |
| From: Michael Dummett (Thought and Reality [1997], 1) | |
| A reaction: [He cites early Wittgenstein as an example] But 'no patch of red here' (or sense-datum) seems identical to 'no patch of green here'. I suppose you could catalogue all the atomic facts, and note that red wasn't among them. But you could do that for birds. |
| 8161 | We know we can state facts, with true statements [Dummett] |
| Full Idea: One thing we know about facts, namely that we can state them. Whenever we make some true statement, we state some fact. | |
| From: Michael Dummett (Thought and Reality [1997], 1) | |
| A reaction: Then facts become boring, and are subsumed within the problem of what 'true' means. Personally I have a concept of facts which includes unstatable facts. The physical basis of melancholy I take to be a complex fact which is beyond our powers. |
| 8180 | 'That is red or orange' might be considered true, even though 'that is red' and 'that is orange' were not [Dummett] |
| Full Idea: A statement of the form 'that is red or orange', said of something on the borderline between the two colours, might rank as true, although neither 'that is red' nor 'that is orange' was true. | |
| From: Michael Dummett (Thought and Reality [1997], 5) | |
| A reaction: It seems to me that the problem here would be epistemological rather than ontological. One of the two is clearly true, but sometimes we can't decide which. How can anyone say 'It isn't red and it isn't orange, but it is either red or orange'? |
| 9723 | Sentences with 'if' are only conditionals if they can read as A-implies-B [Enderton] |
| Full Idea: Not all sentences using 'if' are conditionals. Consider 'if you want a banana, there is one in the kitchen'. The rough test is that a conditional can be rewritten as 'that A implies that B'. | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], 1.6.4) |
| 8178 | Empirical and a priori knowledge are not distinct, but are extremes of a sliding scale [Dummett] |
| Full Idea: Our sentences cannot be divided into two classes, empirical and a priori, the truth of one to be decided by observation, the other by ratiocination. They lie on a scale, with observational sentences at one end, and mathematical ones at the other. | |
| From: Michael Dummett (Thought and Reality [1997], 5) | |
| A reaction: The modern post-Kantian dissolution of the rationalist-empiricist debate. I would say that mathematical sentences require no empirical evidence (for their operation, rather than foundation), but a bit of reasoning is involved in observation. |
| 8175 | A theory of thought will include propositional attitudes as well as propositions [Dummett] |
| Full Idea: A comprehensive theory of thought will include such things as judgement and belief, as well as the mere grasp of propositions. | |
| From: Michael Dummett (Thought and Reality [1997], 4) | |
| A reaction: This seems to make any theory of thought a neat two-stage operation. Beware of neatness. While propositions might be explained using concepts, syntax and truth, the second stage looks faintly daunting. See Idea 2209, for example. |
| 8174 | The theories of meaning and understanding are the only routes to an account of thought [Dummett] |
| Full Idea: For the linguistic philosopher, the theory of meaning, and the theory of understanding that is built upon it, form the only route to a philosophical account of thought. | |
| From: Michael Dummett (Thought and Reality [1997], 4) | |
| A reaction: I am of the party that thinks thought is prior to language (esp. because of animals), but Dummett's idea does not deny this. He may well be right that this is the 'only route'. We can only hope to give an account of human thought. |
| 8165 | To 'abstract from' is a logical process, as opposed to the old mental view [Dummett] |
| Full Idea: The phrase 'abstracted from' does not refer to the mental process of abstraction by disregarding features of concrete objects, in which many nineteenth century thinkers believed; it is a logical (not mental) process of concept-formation. | |
| From: Michael Dummett (Thought and Reality [1997], 1) | |
| A reaction: I take Frege's attack on 'psychologism' to be what dismissed the old view (Idea 5816). Could one not achieve the same story by negating properties in quantified logical expressions, instead of in the mind? |
| 8168 | To know the truth-conditions of a sentence, you must already know the meaning [Dummett] |
| Full Idea: You can know the condition for a sentence to be true only when you know what the sentence means. | |
| From: Michael Dummett (Thought and Reality [1997], 3) | |
| A reaction: This makes the truth-conditions theory of meaning circular, and is Dummett's big objection to Davidson's view. The composition of a sentence creates a model of a world. Truth-conditions may only presuppose knowledge of concepts. |
| 8181 | A justificationist theory of meaning leads to the rejection of classical logic [Dummett] |
| Full Idea: If we adopt a justificationist theory of meaning, we must reject the universal law of excluded middle, and with it classical logic (which rests on the two-valued semantics of bivalence). We admit only intuitionist logic, which preserves justifiability. | |
| From: Michael Dummett (Thought and Reality [1997], 5) | |
| A reaction: This is Dummett's philosophy in a very neat nutshell. He seems to have started by accepting Brouwer's intuitionism, and then working back to language. It all implies anti-realism. I don't buy it. |
| 8182 | Verificationism could be realist, if we imagined the verification by a superhuman power [Dummett] |
| Full Idea: There is a possible route to realism, which has been called 'ideal verificationism', if we base our grasping the understanding and truth of a range of sentences on the procedure that would be available to an imagined being with superhuman powers. | |
| From: Michael Dummett (Thought and Reality [1997], 5) | |
| A reaction: This is actually a slippery slope for verificationists, as soon as they allow that verification could be done by other people. A verifier might turn up who had telepathy, or x-ray vision, or could see quarks... |
| 8183 | If truths about the past depend on memories and current evidence, the past will change [Dummett] |
| Full Idea: If justificationists succumb to the temptation for statements in the past, we shall view their senses as given by present memories and present traces of past events; but this will force us into a view of the past as itself changing. | |
| From: Michael Dummett (Thought and Reality [1997], 6) | |
| A reaction: Obviously Dummett attempts to sidestep this problem, but it strikes me as powerful support for the realist view about the past. How can we not be committed to the view that there are facts about the past quite unconnected to our verifying abilities? |
| 8176 | We could only guess the meanings of 'true' and 'false' when sentences were used [Dummett] |
| Full Idea: Even if we guessed that the two words denoted the two truth-values, we should not know which stood for the value 'true' and which for the value 'false' until we knew how the sentences were in practice used. | |
| From: Michael Dummett (Thought and Reality [1997], 4) | |
| A reaction: These types of problem are always based on the idea that some one item must have logical priority in the process, but there is a lot of room for benign circularity in the development of mental and linguistic functions. |
| 8170 | Sentences are the primary semantic units, because they can say something [Dummett] |
| Full Idea: While words are semantic atoms, sentences remain the primary semantic units, in the sense of the smallest bits of language by means of which it is possible to say anything. | |
| From: Michael Dummett (Thought and Reality [1997], 3) | |
| A reaction: Syncategorematic terms (look it up!) may need sentences, but most nouns and verbs can communicate quite a lot on their own. Whether words or sentences come first may not be a true/false issue. |
| 8169 | We can't distinguish a proposition from its content [Dummett] |
| Full Idea: No distinction can be drawn between a proposition and its content; no two distinct propositions can have the same content. | |
| From: Michael Dummett (Thought and Reality [1997], 3) | |
| A reaction: And one proposition cannot have two possible contents (ambiguity). Are we to say that a proposition supervenes on its content, or that proposition and content are identical? Ockham favours the latter. |
| 13304 | Learned men gain more in one day than others do in a lifetime [Posidonius] |
| Full Idea: In a single day there lies open to men of learning more than there ever does to the unenlightened in the longest of lifetimes. | |
| From: Posidonius (fragments/reports [c.95 BCE]), quoted by Seneca the Younger - Letters from a Stoic 078 | |
| A reaction: These remarks endorsing the infinite superiority of the educated to the uneducated seem to have been popular in late antiquity. It tends to be the religions which discourage great learning, especially in their emphasis on a single book. |
| 20820 | Time is an interval of motion, or the measure of speed [Posidonius, by Stobaeus] |
| Full Idea: Posidonius defined time thus: it is an interval of motion, or the measure of speed and slowness. | |
| From: report of Posidonius (fragments/reports [c.95 BCE]) by John Stobaeus - Anthology 1.08.42 | |
| A reaction: Hm. Can we define motion or speed without alluding to time? Looks like we have to define them as a conjoined pair, which means we cannot fully understand either of them. |
| 8186 | Time is the measure of change, so we can't speak of time before all change [Dummett] |
| Full Idea: Time is the measure of change, and it makes no sense to speak of how things were before there was anything that changed. | |
| From: Michael Dummett (Thought and Reality [1997], 8) | |
| A reaction: Something creating its own measure sounds like me marking my own exam papers. If an object appears, then inverts five seconds later, how can the inversion create the five seconds? How does that differ from inverting ten seconds later? |
| 8167 | If Presentism is correct, we cannot even say that the present changes [Dummett] |
| Full Idea: If Presentism is correct - the doctrine that there is nothing at all, save what holds good at the present moment - then we cannot even say that the present changes, because that requires that things are not now as they were some time ago. | |
| From: Michael Dummett (Thought and Reality [1997], 2) | |
| A reaction: Presumably we can compare our present memory with our present experience. See Idea 6668. The logic (very ancient!) is that the present has not duration at all, and so no experiences can occur during it. |