40 ideas
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. |
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. |
15086 | Absolute necessity might be achievable either logically or metaphysically [Hale] |
Full Idea: Maybe peaceful co-existence between absolute logical necessity and absolute metaphysical necessity can be secured, ..and absolute necessity is their union. ...However, a truth would then qualify as absolutely necessary in two quite different ways. | |
From: Bob Hale (Absolute Necessities [1996], 4) | |
A reaction: Hale is addressing a really big question for metaphysic (absolute necessity) which others avoid. In the end he votes for rejecting 'metaphysical' necessity. I am tempted to vote for rejecting logical necessity (as being relative). 'Absolute' is an ideal. |
8261 | Maybe not-p is logically possible, but p is metaphysically necessary, so the latter is not absolute [Hale] |
Full Idea: It might be metaphysically necessary that p but logically possible that not-p, so that metaphysical necessity is not, after all, absolute. | |
From: Bob Hale (Absolute Necessities [1996]), quoted by E.J. Lowe - The Possibility of Metaphysics 1.5 | |
A reaction: Lowe presents this as dilemma, but it sounds fine to me. Flying pigs etc. have no apparent logical problems, but I can't conceive of a possible world where pigs like ours fly in a world like ours. Earthbound pigs may be metaphysically necessary. |
15081 | A strong necessity entails a weaker one, but not conversely; possibilities go the other way [Hale] |
Full Idea: One type of necessity may be said to be 'stronger' than another when the first always entails the second, but not conversely. This will obtain only if the possibility of the first is weaker than the possibility of the second. | |
From: Bob Hale (Absolute Necessities [1996], 1) | |
A reaction: Thus we would normally say that if something is logically necessary (a very strong claim) then it will have to be naturally necessary. If something is naturally possible, then clearly it will have to be logically possible. Sounds OK. |
15080 | 'Relative' necessity is just a logical consequence of some statements ('strong' if they are all true) [Hale] |
Full Idea: Necessity is 'relative' if a claim of φ-necessary that p just claims that it is a logical consequence of some statements Φ that p. We have a 'strong' version if we add that the statements in Φ are all true, and a 'weak' version if not. | |
From: Bob Hale (Absolute Necessities [1996], 1) | |
A reaction: I'm not sure about 'logical' consequence here. It may be necessary that a thing be a certain way in order to qualify for some category (which would be 'relative'), but that seems like 'sortal' necessity rather than logical. |
15082 | Metaphysical necessity says there is no possibility of falsehood [Hale] |
Full Idea: Friends of metaphysical necessity would want to hold that when it is metaphysically necessary that p, there is no good sense of 'possible' (except, perhaps, an epistemic one) in which it is possible that not-p. | |
From: Bob Hale (Absolute Necessities [1996], 2) | |
A reaction: We might want to say which possible worlds this refers to (and presumably it won't just be in the actual world). The normal claim would refer to all possible worlds. Adding a '...provided that' clause moves it from absolute to relative necessity. |
15085 | 'Broadly' logical necessities are derived (in a structure) entirely from the concepts [Hale] |
Full Idea: 'Broadly' logical necessities are propositions whose truth derives entirely from the concepts involved in them (together, of course, with relevant structure). | |
From: Bob Hale (Absolute Necessities [1996], 3) | |
A reaction: Is the 'logical' part of this necessity bestowed by the concepts, or by the 'structure' (which I take to be a logical structure)? |
15088 | Logical necessities are true in virtue of the nature of all logical concepts [Hale] |
Full Idea: The logical necessities can be taken to be the propositions which are true in virtue of the nature of all logical concepts. | |
From: Bob Hale (Absolute Necessities [1996], p.10) | |
A reaction: This is part of his story of essences giving rise to necessities. His proposal sounds narrow, but logical concepts may have the highest degree of generality which it is possible to have. It must be how the concepts connect that causes the necessities. |
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) |
15087 | Conceptual necessities are made true by all concepts [Hale] |
Full Idea: Conceptual necessities can be taken to be propositions which are true in virtue of the nature of all concepts. | |
From: Bob Hale (Absolute Necessities [1996], p.9) | |
A reaction: Fine endorse essences for these concepts. Could we then come up with a new concept which contradicted all the others, and destroyed the necessity? Yes, presumably. Presumably witchcraft and astrology are full of 'conceptual necessities'. |
1748 | Archelaus was the first person to say that the universe is boundless [Archelaus, by Diog. Laertius] |
Full Idea: Archelaus was the first person to say that the universe is boundless. | |
From: report of Archelaus (fragments/reports [c.450 BCE]) by Diogenes Laertius - Lives of Eminent Philosophers 02.Ar.3 |
5989 | Archelaus said life began in a primeval slime [Archelaus, by Schofield] |
Full Idea: Archelaus wrote that life on Earth began in a primeval slime. | |
From: report of Archelaus (fragments/reports [c.450 BCE]) by Malcolm Schofield - Archelaus | |
A reaction: This sounds like a fairly clearcut assertion of the production of life by evolution. Darwin's contribution was to propose the mechanism for achieving it. We should honour the name of Archelaus for this idea. |