Combining Texts

All the ideas for 'Reply to Richards', 'What is Justified Belief?' and 'Intro to Non-Classical Logic (1st ed)'

unexpand these ideas     |    start again     |     specify just one area for these texts


32 ideas

1. Philosophy / E. Nature of Metaphysics / 3. Metaphysical Systems
The greatest philosophers are methodical; it is what makes them great [Grice]
     Full Idea: The greatest philosophers have been the greatest, and most self-conscious, methodologists; indeed, I am tempted to regard the fact as primarily accounting for their greatness as philosophers.
     From: H. Paul Grice (Reply to Richards [1986], p.66), quoted by Stephen Boulter - Why Medieval Philosophy Matters 3
     A reaction: I agree. Philosophy is nothing if it is not devoted to the attempt to be fully rational, and that implies consistency and coherence. If a thinker doesn't even try to be systematic, I would not consider them to be a philosopher.
4. Formal Logic / E. Nonclassical Logics / 6. Free Logic
Free logic is one of the few first-order non-classical logics [Priest,G]
     Full Idea: Free logic is an unusual example of a non-classical logic which is first-order.
     From: Graham Priest (Intro to Non-Classical Logic (1st ed) [2001], Pref)
4. Formal Logic / F. Set Theory ST / 2. Mechanics of Set Theory / a. Symbols of ST
X1 x X2 x X3... x Xn indicates the 'cartesian product' of those sets [Priest,G]
     Full Idea: X1 x X2 x X3... x Xn indicates the 'cartesian product' of those sets, the set of all the n-tuples with its first member in X1, its second in X2, and so on.
     From: Graham Priest (Intro to Non-Classical Logic (1st ed) [2001], 0.1.0)
<a,b&62; is a set whose members occur in the order shown [Priest,G]
     Full Idea: <a,b> is a set whose members occur in the order shown; <x1,x2,x3, ..xn> is an 'n-tuple' ordered set.
     From: Graham Priest (Intro to Non-Classical Logic (1st ed) [2001], 0.1.10)
a ∈ X says a is an object in set X; a ∉ X says a is not in X [Priest,G]
     Full Idea: a ∈ X means that a is a member of the set X, that is, a is one of the objects in X. a ∉ X indicates that a is not in X.
     From: Graham Priest (Intro to Non-Classical Logic (1st ed) [2001], 0.1.2)
{x; A(x)} is a set of objects satisfying the condition A(x) [Priest,G]
     Full Idea: {x; A(x)} indicates a set of objects which satisfy the condition A(x).
     From: Graham Priest (Intro to Non-Classical Logic (1st ed) [2001], 0.1.2)
{a1, a2, ...an} indicates that a set comprising just those objects [Priest,G]
     Full Idea: {a1, a2, ...an} indicates that the set comprises of just those objects.
     From: Graham Priest (Intro to Non-Classical Logic (1st ed) [2001], 0.1.2)
Φ indicates the empty set, which has no members [Priest,G]
     Full Idea: Φ indicates the empty set, which has no members
     From: Graham Priest (Intro to Non-Classical Logic (1st ed) [2001], 0.1.4)
{a} is the 'singleton' set of a (not the object a itself) [Priest,G]
     Full Idea: {a} is the 'singleton' set of a, not to be confused with the object a itself.
     From: Graham Priest (Intro to Non-Classical Logic (1st ed) [2001], 0.1.4)
X⊂Y means set X is a 'proper subset' of set Y [Priest,G]
     Full Idea: X⊂Y means set X is a 'proper subset' of set Y (if and only if all of its members are members of Y, but some things in Y are not in X)
     From: Graham Priest (Intro to Non-Classical Logic (1st ed) [2001], 0.1.6)
X⊆Y means set X is a 'subset' of set Y [Priest,G]
     Full Idea: X⊆Y means set X is a 'subset' of set Y (if and only if all of its members are members of Y).
     From: Graham Priest (Intro to Non-Classical Logic (1st ed) [2001], 0.1.6)
X = Y means the set X equals the set Y [Priest,G]
     Full Idea: X = Y means the set X equals the set Y, which means they have the same members (i.e. X⊆Y and Y⊆X).
     From: Graham Priest (Intro to Non-Classical Logic (1st ed) [2001], 0.1.6)
X ∩ Y indicates the 'intersection' of sets X and Y, the objects which are in both sets [Priest,G]
     Full Idea: X ∩ Y indicates the 'intersection' of sets X and Y, which is a set containing just those things that are in both X and Y.
     From: Graham Priest (Intro to Non-Classical Logic (1st ed) [2001], 0.1.8)
X∪Y indicates the 'union' of all the things in sets X and Y [Priest,G]
     Full Idea: X ∪ Y indicates the 'union' of sets X and Y, which is a set containing just those things that are in X or Y (or both).
     From: Graham Priest (Intro to Non-Classical Logic (1st ed) [2001], 0.1.8)
Y - X is the 'relative complement' of X with respect to Y; the things in Y that are not in X [Priest,G]
     Full Idea: Y - X indicates the 'relative complement' of X with respect to Y, that is, all the things in Y that are not in X.
     From: Graham Priest (Intro to Non-Classical Logic (1st ed) [2001], 0.1.8)
4. Formal Logic / F. Set Theory ST / 2. Mechanics of Set Theory / b. Terminology of ST
The 'relative complement' is things in the second set not in the first [Priest,G]
     Full Idea: The 'relative complement' of one set with respect to another is the things in the second set that aren't in the first.
     From: Graham Priest (Intro to Non-Classical Logic (1st ed) [2001], 0.1.8)
The 'intersection' of two sets is a set of the things that are in both sets [Priest,G]
     Full Idea: The 'intersection' of two sets is a set containing the things that are in both sets.
     From: Graham Priest (Intro to Non-Classical Logic (1st ed) [2001], 0.1.8)
The 'union' of two sets is a set containing all the things in either of the sets [Priest,G]
     Full Idea: The 'union' of two sets is a set containing all the things in either of the sets
     From: Graham Priest (Intro to Non-Classical Logic (1st ed) [2001], 0.1.8)
The 'induction clause' says complex formulas retain the properties of their basic formulas [Priest,G]
     Full Idea: The 'induction clause' says that whenever one constructs more complex formulas out of formulas that have the property P, the resulting formulas will also have that property.
     From: Graham Priest (Intro to Non-Classical Logic (1st ed) [2001], 0.2)
A 'singleton' is a set with only one member [Priest,G]
     Full Idea: A 'singleton' is a set with only one member.
     From: Graham Priest (Intro to Non-Classical Logic (1st ed) [2001], 0.1.4)
A 'member' of a set is one of the objects in the set [Priest,G]
     Full Idea: A 'member' of a set is one of the objects in the set.
     From: Graham Priest (Intro to Non-Classical Logic (1st ed) [2001], 0.1.2)
An 'ordered pair' (or ordered n-tuple) is a set with its members in a particular order [Priest,G]
     Full Idea: An 'ordered pair' (or ordered n-tuple) is a set with its members in a particular order.
     From: Graham Priest (Intro to Non-Classical Logic (1st ed) [2001], 0.1.10)
A 'cartesian product' of sets is the set of all the n-tuples with one member in each of the sets [Priest,G]
     Full Idea: A 'cartesian product' of sets is the set of all the n-tuples with one member in each of the sets.
     From: Graham Priest (Intro to Non-Classical Logic (1st ed) [2001], 0.1.10)
A 'set' is a collection of objects [Priest,G]
     Full Idea: A 'set' is a collection of objects.
     From: Graham Priest (Intro to Non-Classical Logic (1st ed) [2001], 0.1.2)
The 'empty set' or 'null set' has no members [Priest,G]
     Full Idea: The 'empty set' or 'null set' is a set with no members.
     From: Graham Priest (Intro to Non-Classical Logic (1st ed) [2001], 0.1.4)
A set is a 'subset' of another set if all of its members are in that set [Priest,G]
     Full Idea: A set is a 'subset' of another set if all of its members are in that set.
     From: Graham Priest (Intro to Non-Classical Logic (1st ed) [2001], 0.1.6)
A 'proper subset' is smaller than the containing set [Priest,G]
     Full Idea: A set is a 'proper subset' of another set if some things in the large set are not in the smaller set
     From: Graham Priest (Intro to Non-Classical Logic (1st ed) [2001], 0.1.6)
4. Formal Logic / F. Set Theory ST / 2. Mechanics of Set Theory / c. Basic theorems of ST
The empty set Φ is a subset of every set (including itself) [Priest,G]
     Full Idea: The empty set Φ is a subset of every set (including itself).
     From: Graham Priest (Intro to Non-Classical Logic (1st ed) [2001], 0.1.6)
13. Knowledge Criteria / A. Justification Problems / 3. Internal or External / a. Pro-internalism
A belief can be justified when the person has forgotten the evidence for it [Goldman]
     Full Idea: A characteristic case in which a belief is justified though the cognizer doesn't know that it's justified is where the original evidence for the belief has long since been forgotten.
     From: Alvin I. Goldman (What is Justified Belief? [1976], II)
     A reaction: This is a central problem for any very literal version of internalism. The fully rationalist view (to which I incline) will be that the cognizer must make a balanced assessment of whether they once had the evidence. Were my teachers any good?
13. Knowledge Criteria / A. Justification Problems / 3. Internal or External / b. Pro-externalism
If justified beliefs are well-formed beliefs, then animals and young children have them [Goldman]
     Full Idea: If one shares my view that justified belief is, at least roughly, well-formed belief, surely animals and young children can have justified beliefs.
     From: Alvin I. Goldman (What is Justified Belief? [1976], III)
     A reaction: I take this to be a key hallmark of the externalist view of knowledge. Personally I think we should tell the animals that they have got true beliefs, but that they aren't bright enough to aspire to 'knowledge'. Be grateful for what you've got.
13. Knowledge Criteria / C. External Justification / 3. Reliabilism / a. Reliable knowledge
Justification depends on the reliability of its cause, where reliable processes tend to produce truth [Goldman]
     Full Idea: The justificational status of a belief is a function of the reliability of the processes that cause it, where (provisionally) reliability consists in the tendency of a process to produce beliefs that are true rather than false.
     From: Alvin I. Goldman (What is Justified Belief? [1976], II)
     A reaction: Goldman's original first statement of reliabilism, now the favourite version of externalism. The obvious immediate problem is when a normally very reliable process goes wrong. Wise people still get it wrong, or right for the wrong reasons.
16. Persons / C. Self-Awareness / 1. Introspection
Introspection is really retrospection; my pain is justified by a brief causal history [Goldman]
     Full Idea: Introspection should be regarded as a form of retrospection. Thus, a justified belief that I am 'now' in pain gets its justificational status from a relevant, though brief, causal history.
     From: Alvin I. Goldman (What is Justified Belief? [1976], II)
     A reaction: He cites Hobbes and Ryle as having held this view. See Idea 6668. I am unclear why the history must be 'causal'. I may not know the cause of the pain. I may not believe an event which causes a proposition, or I may form a false belief from it.