display all the ideas for this combination of texts
22 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. |
8943 | Three-valued logic says excluded middle and non-contradition are not tautologies [Fisher] |
Full Idea: In three-valued logic (L3), neither the law of excluded middle (p or not-p), nor the law of non-contradiction (not(p and not-p)) will be tautologies. If p has the value 'indeterminate' then so will not-p. | |
From: Jennifer Fisher (On the Philosophy of Logic [2008], 07.I) | |
A reaction: I quite accept that the world is full of indeterminate propositions, and that excluded middle and non-contradiction can sometimes be uncertain, but I am reluctant to accept that what is being offered here should be called 'logic'. |
8945 | Fuzzy logic has many truth values, ranging in fractions from 0 to 1 [Fisher] |
Full Idea: In fuzzy logic objects have properties to a greater or lesser degree, and truth values are given as fractions or decimals, ranging from 0 to 1. Not-p is defined as 1-p, and other formula are defined in terms of maxima and minima for sets. | |
From: Jennifer Fisher (On the Philosophy of Logic [2008], 07.II) | |
A reaction: The question seems to be whether this is actually logic, or a recasting of probability theory. Susan Haack attacks it. If logic is the study of how truth is preserved as we move between propositions, then 0 and 1 need a special status. |
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) |