47 ideas
| 8368 | A correct definition is what can be substituted without loss of meaning [Ducasse] |
| Full Idea: A definition of a word is correct if the definition can be substituted for the word being defined in an assertion without in the least changing the meaning which the assertion is felt to have. | |
| From: Curt Ducasse (Nature and Observability of Causal Relations [1926], §1) | |
| A reaction: This sounds good, but a very bland and uninformative rephrasing would fit this account, without offering anything very helpful. The word 'this' could be substituted for a lot of object words. A 'blade' is 'a thing always attached to a knife handle'. |
| 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. |
| 4975 | A thought can be split in many ways, so that different parts appear as subject or predicate [Frege] |
| Full Idea: A thought can be split up in many ways, so that now one thing, now another, appears as subject or predicate | |
| From: Gottlob Frege (On Concept and Object [1892], p.199) | |
| A reaction: Thus 'the mouse is in the box', and 'the box contains the mouse'. A simple point, but important when we are trying to distinguish thought from language. |
| 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. |
| 9949 | There is the concept, the object falling under it, and the extension (a set, which is also an object) [Frege, by George/Velleman] |
| Full Idea: For Frege, the extension of the concept F is an object, as revealed by the fact that we use a name to refer to it. ..We must distinguish the concept, the object that falls under it, and the extension of the concept, which is the set containing the object. | |
| From: report of Gottlob Frege (On Concept and Object [1892]) by A.George / D.J.Velleman - Philosophies of Mathematics Ch.2 | |
| A reaction: This I take to be the key distinction needed if one is to grasp Frege's account of what a number is. When we say that Frege is a platonist about numbers, it is because he is committed to the notion that the extension is an object. |
| 18995 | Frege mistakenly takes existence to be a property of concepts, instead of being about things [Frege, by Yablo] |
| Full Idea: Frege's theory treats existence as a property, not of things we call existent, but of concepts instantiated by those things. 'Biden exists' says our Biden-concept has instances. That is certainly not how it feels! We speak of the thing, not of concepts. | |
| From: report of Gottlob Frege (On Concept and Object [1892]) by Stephen Yablo - Aboutness 01.4 | |
| A reaction: Yablo's point is that you must ask what the sentence is 'about', and then the truth will refer to those things. Frege gets into a tangle because he thinks remarks using concepts are about the concepts. |
| 10317 | It is unclear whether Frege included qualities among his abstract objects [Frege, by Hale] |
| Full Idea: Expositors of Frege's views have disagreed over whether abstract qualities are to be reckoned among his objects. | |
| From: report of Gottlob Frege (On Concept and Object [1892]) by Bob Hale - Abstract Objects Ch.2.II | |
| A reaction: [he cites Dummett 1973:70-80, and Wright 1983:25-8] There seems to be a danger here of a collision between Fregean verbal approaches to ontological commitment and the traditional views about universals. No wonder they can't decide. |
| 10535 | Frege's 'objects' are both the referents of proper names, and what predicates are true or false of [Frege, by Dummett] |
| Full Idea: Frege's notion of an object plays two roles in his semantics. Objects are the referents of proper names, and they are equally what predicates are true and false of. | |
| From: report of Gottlob Frege (On Concept and Object [1892]) by Michael Dummett - Frege Philosophy of Language (2nd ed) Ch.4 | |
| A reaction: Frege is the source of a desperate desire to turn everything into an object (see Idea 8858!), and he has the irritating authority of the man who invented quantificational logic. Nothing but trouble, that man. |
| 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) |
| 9839 | Frege equated the concepts under which an object falls with its properties [Frege, by Dummett] |
| Full Idea: Frege equated the concepts under which an object falls with its properties. | |
| From: report of Gottlob Frege (On Concept and Object [1892], p.201) by Michael Dummett - Frege philosophy of mathematics Ch.8 | |
| A reaction: I take this to be false, as objects can fall under far more concepts than they have properties. I don't even think 'being a pencil' is a property of pencils, never mind 'being my favourite pencil', or 'not being Alexander the Great'. |
| 4973 | As I understand it, a concept is the meaning of a grammatical predicate [Frege] |
| Full Idea: As I understand it, a concept is the meaning of a grammatical predicate. | |
| From: Gottlob Frege (On Concept and Object [1892], p.193) | |
| A reaction: All the ills of twentieth century philosophy reside here, because it makes a concept an entirely linguistic thing, so that animals can't have concepts, and language is cut off from reality, leading to relativism, pragmatism, and other nonsense. |
| 9167 | Frege felt that meanings must be public, so they are abstractions rather than mental entities [Frege, by Putnam] |
| Full Idea: Frege felt that meanings are public property, and identified concepts (and hence 'intensions' or meanings) with abstract entities rather than mental entities. | |
| From: report of Gottlob Frege (On Concept and Object [1892]) by Hilary Putnam - Meaning and Reference p.150 | |
| A reaction: This is the germ of Wittgenstein's private language argument. I am inclined to feel that Frege approached language strictly as a logician, and didn't really care that he got himself into implausible platonist ontological commitments. |
| 4974 | For all the multiplicity of languages, mankind has a common stock of thoughts [Frege] |
| Full Idea: For all the multiplicity of languages, mankind has a common stock of thoughts. | |
| From: Gottlob Frege (On Concept and Object [1892], p.196n) | |
| A reaction: Given the acknowledgement here that two very different sentences in different languages can express the same thought, he should recognise that at least some aspects of a thought are non-linguistic. |
| 8367 | Causation is defined in terms of a single sequence, and constant conjunction is no part of it [Ducasse] |
| Full Idea: The correct definition of the causal relation is to be framed in terms of one single case of sequence, and constancy of conjunction is therefore no part of it. | |
| From: Curt Ducasse (Nature and Observability of Causal Relations [1926], Intro) | |
| A reaction: This is the thesis of Ducasse's paper. I immediately warm to it. I take constant conjunction to be a consequence and symptom of causation, not its nature. There is a classic ontology/epistemology confusion to be avoided here. |
| 8372 | We see what is in common between causes to assign names to them, not to perceive them [Ducasse] |
| Full Idea: The part of a generalization concerning what is common to one individual concrete event and the causes of certain other events of the same kind is involved in the mere assigning of a name to the cause and its effect, but not in the perceiving them. | |
| From: Curt Ducasse (Nature and Observability of Causal Relations [1926], §5) | |
| A reaction: A nice point, that we should keep distinct the recognition of a cause, and the assigning of a general name to it. Ducasse is claiming that we can directly perceive singular causation. |
| 8369 | Causes are either sufficient, or necessary, or necessitated, or contingent upon [Ducasse] |
| Full Idea: There are four causal connections: an event is sufficient for another if it is its cause; an event is necessary for another if it is a condition for it; it is necessitated by another if it is an effect; it is contingent upon another if it is a resultant. | |
| From: Curt Ducasse (Nature and Observability of Causal Relations [1926], §2) | |
| A reaction: An event could be a condition for another without being necessary. He seems to have missed the indispensable aspect of a necessary condition. |
| 8373 | When a brick and a canary-song hit a window, we ignore the canary if we are interested in the breakage [Ducasse] |
| Full Idea: If a brick and the song of a canary strike a window, which breaks....we can truly say that the song of the canary had nothing to do with it, that is, in so far as what occurred is viewed merely as a case of breakage of window. | |
| From: Curt Ducasse (Nature and Observability of Causal Relations [1926], §5) | |
| A reaction: This is the germ of Davidson's view, that causation is entirely dependent on the mode of description, rather than being an actual feature of reality. If one was interested in the sound of the breakage, the canary would become relevant. |
| 8370 | A cause is a change which occurs close to the effect and just before it [Ducasse] |
| Full Idea: The cause of the particular change K was such particular change C as alone occurred in the immediate environment of K immediately before. | |
| From: Curt Ducasse (Nature and Observability of Causal Relations [1926], §3) | |
| A reaction: The obvious immediately difficulty would be overdetermination, as when it rains while I am watering my garden. The other problem would coincidence, as when I clap my hands just before a bomb goes off. |
| 8371 | Recurrence is only relevant to the meaning of law, not to the meaning of cause [Ducasse] |
| Full Idea: The supposition of recurrence is wholly irrelevant to the meaning of cause: that supposition is relevant only to the meaning of law. | |
| From: Curt Ducasse (Nature and Observability of Causal Relations [1926], §4) | |
| A reaction: This sounds plausible, especially if our notion of laws of nature is built up from a series of caused events. But we could just have an ontology of 'similar events', out of which we build laws, and 'causation' could drop out (á la Russell). |
| 8374 | We are interested in generalising about causes and effects purely for practical purposes [Ducasse] |
| Full Idea: We are interested in causes and effects primarily for practical purposes, which needs generalizations; so the interest of concrete individual facts of causation is chiefly an indirect one, as raw material for generalizations. | |
| From: Curt Ducasse (Nature and Observability of Causal Relations [1926], §6) | |
| A reaction: A nice explanation of why, if causation is fundamentally about single instances, people seem so interested in generalisations and laws. We want to predict, and we want to explain, and we want to intervene. |