39 ideas
| 13737 | The empiricist says that metaphysics is meaningless, rather than false [Schlick] |
| Full Idea: The empiricist does not say to the metaphysician 'what you say is false', but 'what you say asserts nothing at all!' He does not contradict him, but says 'I don't understand you'. | |
| From: Moritz Schlick (Positivism and Realism [1934], p.107), quoted by Jonathan Schaffer - On What Grounds What 1.1 | |
| A reaction: I take metaphysics to be meaningful, but at such a high level of abstraction that it is easy to drift into vague nonsense, and incredibly hard to assess what is meant, and whether it is correct. The truths of metaphysics are not recursive. |
| 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) |
| 13430 | Infinity: there is an infinity of distinguishable individuals [Ramsey] |
| Full Idea: The Axiom of Infinity means that there are an infinity of distinguishable individuals, which is an empirical proposition. | |
| From: Frank P. Ramsey (The Foundations of Mathematics [1925], §5) | |
| A reaction: The Axiom sounds absurd, as a part of a logical system, but Ramsey ends up defending it. Logical tautologies, which seem to be obviously true, are rendered absurd if they don't refer to any objects, and some of them refer to infinities of objects. |
| 13428 | Reducibility: to every non-elementary function there is an equivalent elementary function [Ramsey] |
| Full Idea: The Axiom of Reducibility asserted that to every non-elementary function there is an equivalent elementary function [note: two functions are equivalent when the same arguments render them both true or both false]. | |
| From: Frank P. Ramsey (The Foundations of Mathematics [1925], §2) | |
| A reaction: Ramsey in the business of showing that this axiom from Russell and Whitehead is not needed. He says that the axiom seems to be needed for induction and for Dedekind cuts. Since the cuts rest on it, and it is weak, Ramsey says it must go. |
| 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. |
| 13427 | Either 'a = b' vacuously names the same thing, or absurdly names different things [Ramsey] |
| Full Idea: In 'a = b' either 'a' and 'b' are names of the same thing, in which case the proposition says nothing, or of different things, in which case it is absurd. In neither case is it an assertion of a fact; it only asserts when a or b are descriptions. | |
| From: Frank P. Ramsey (The Foundations of Mathematics [1925], §1) | |
| A reaction: This is essentially Frege's problem with Hesperus and Phosphorus. How can identities be informative? So 2+2=4 is extensionally vacuous, but informative because they are different descriptions. |
| 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. |
| 13334 | Contradictions are either purely logical or mathematical, or they involved thought and language [Ramsey] |
| Full Idea: Group A consists of contradictions which would occur in a logical or mathematical system, involving terms such as class or number. Group B contradictions are not purely logical, and contain some reference to thought, language or symbolism. | |
| From: Frank P. Ramsey (The Foundations of Mathematics [1925], p.171), quoted by Graham Priest - The Structure of Paradoxes of Self-Reference 1 | |
| A reaction: This has become the orthodox division of all paradoxes, but the division is challenged by Priest (Idea 13373). He suggests that we now realise (post-Tarski?) that language is more involved in logic and mathematics than we thought. |
| 13426 | Formalists neglect content, but the logicists have focused on generalizations, and neglected form [Ramsey] |
| Full Idea: The formalists neglected the content altogether and made mathematics meaningless, but the logicians neglected the form and made mathematics consist of any true generalisations; only by taking account of both sides can we obtain an adequate theory. | |
| From: Frank P. Ramsey (The Foundations of Mathematics [1925], §1) | |
| A reaction: He says mathematics is 'tautological generalizations'. It is a criticism of modern structuralism that it overemphasises form, and fails to pay attention to the meaning of the concepts which stand at the 'nodes' of the structure. |
| 13425 | Formalism is hopeless, because it focuses on propositions and ignores concepts [Ramsey] |
| Full Idea: The hopelessly inadequate formalist theory is, to some extent, the result of considering only the propositions of mathematics and neglecting the analysis of its concepts. | |
| From: Frank P. Ramsey (The Foundations of Mathematics [1925], §1) | |
| A reaction: You'll have to read Ramsey to see how this thought pans out, but it at least gives a pointer to how to go about addressing the question. |
| 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) |
| 22328 | I just confront the evidence, and let it act on me [Ramsey] |
| Full Idea: I can but put the evidence before me, and let it act on my mind. | |
| From: Frank P. Ramsey (The Foundations of Mathematics [1925], p.202), quoted by Michael Potter - The Rise of Analytic Philosophy 1879-1930 70 'Deg' | |
| A reaction: Potter calls this observation 'downbeat', but I am an enthusiastic fan. It is roughly my view of both concept formation and of knowledge. You soak up the world, and respond appropriately. The trick is in the selection of evidence to confront. |
| 22325 | A belief is knowledge if it is true, certain and obtained by a reliable process [Ramsey] |
| Full Idea: I have always said that a belief was knowledge if it was 1) true, ii) certain, iii) obtained by a reliable process. | |
| From: Frank P. Ramsey (The Foundations of Mathematics [1925], p.258), quoted by Michael Potter - The Rise of Analytic Philosophy 1879-1930 66 'Rel' | |
| A reaction: Not sure why it has to be 'certain' as well as 'true'. It seems that 'true' is objective, and 'certain' subjective. I think I know lots of things of which I am not fully certain. Reliabilism long preceded Alvin Goldman. |