Combining Texts

All the ideas for 'Mahaprajnaparamitashastra', 'The Logic of What Might Have Been' and 'A Mathematical Introduction to Logic (2nd)'

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


58 ideas

4. Formal Logic / B. Propositional Logic PL / 3. Truth Tables
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.
4. Formal Logic / D. Modal Logic ML / 2. Tools of Modal Logic / b. Terminology of ML
A world is 'accessible' to another iff the first is possible according to the second [Salmon,N]
     Full Idea: A world w' is accessible to a consistent world w if and only if w' is possible in w. Being 'inaccessible to' or 'possible relative to' a consistent world is simply being possible according to that world, nothing more and nothing less.
     From: Nathan Salmon (The Logic of What Might Have Been [1989], IV)
     A reaction: More illuminating than just saying that w can 'see' w'. Accessibility is internal to worIds. It gives some connection to why we spend time examining modal logic. There is no more important metaphysical notion than what is possible according to actuality.
4. Formal Logic / D. Modal Logic ML / 3. Modal Logic Systems / d. System T
For metaphysics, T may be the only correct system of modal logic [Salmon,N]
     Full Idea: Insofar as modal logic is concerned exclusively with the logic of metaphysical modality, ..T may well be the one and only (strongest) correct system of (first-order) propositional logic.
     From: Nathan Salmon (The Logic of What Might Have Been [1989], Intro)
     A reaction: This contrasts sharply with the orthodox view, that S5 (or at the very least S4) is the correct system for metaphysics.
4. Formal Logic / D. Modal Logic ML / 3. Modal Logic Systems / f. System B
System B has not been justified as fallacy-free for reasoning on what might have been [Salmon,N]
     Full Idea: Even the conventionally accepted system B, which is weaker than S5 and independent of S4, has not been adequately justified as a fallacy-free system of reasoning about what might have been.
     From: Nathan Salmon (The Logic of What Might Have Been [1989], Intro)
In B it seems logically possible to have both p true and p is necessarily possibly false [Salmon,N]
     Full Idea: The characteristic of B has the form φ⊃□◊φ. ...Even if these axioms are necessarily true, it seems logically possible for p to be true while the proposition that p is necessarily possible is at the same time false.
     From: Nathan Salmon (The Logic of What Might Have Been [1989], Intro)
System B implies that possibly-being-realized is an essential property of the world [Salmon,N]
     Full Idea: Friends of B modal logic commit themselves to the loaded claim that it is logically true that the property of possibly being realized (or being a way things might have been) is an essential property of the world.
     From: Nathan Salmon (The Logic of What Might Have Been [1989], V)
     A reaction: I think this 'loaded' formulation captures quite nicely the dispositional view I favour, that the possibilities of the actual world are built into the actual world, and define its nature just as much as the 'categorial' facts do.
4. Formal Logic / D. Modal Logic ML / 3. Modal Logic Systems / g. System S4
What is necessary is not always necessarily necessary, so S4 is fallacious [Salmon,N]
     Full Idea: We can say of a wooden table that it would have been possible for it to have originated from some different matter, even though it is not actually possible. So what is necessary fails to be necessarily necessary, and S4 modal logic is fallacious.
     From: Nathan Salmon (The Logic of What Might Have Been [1989], I)
     A reaction: [compressed]
4. Formal Logic / D. Modal Logic ML / 3. Modal Logic Systems / h. System S5
S5 modal logic ignores accessibility altogether [Salmon,N]
     Full Idea: When we ignore accessibility altogether, we have finally zeroed in on S5 modal logic.
     From: Nathan Salmon (The Logic of What Might Have Been [1989], IV)
S5 believers say that-things-might-have-been-that-way is essential to ways things might have been [Salmon,N]
     Full Idea: Believers in S5 as a correct system of propositional reasoning about what might have been must claim that it is an essential property of any way things might have been that things might have been that way.
     From: Nathan Salmon (The Logic of What Might Have Been [1989], V)
     A reaction: Salmon is working in a view where you are probably safe to substitute 'necessary' for 'essential' without loss of meaning.
The unsatisfactory counterpart-theory allows the retention of S5 [Salmon,N]
     Full Idea: Counterpart-theoretic modal semantics allows for the retention of S5 modal propositional logic, at a considerable cost.
     From: Nathan Salmon (The Logic of What Might Have Been [1989], V n18)
     A reaction: See the other ideas in this paper by Salmon for his general attack on S5 as the appropriate system for metaphysical necessity. He favours the very modest System T.
4. Formal Logic / D. Modal Logic ML / 4. Alethic Modal Logic
Metaphysical (alethic) modal logic concerns simple necessity and possibility (not physical, epistemic..) [Salmon,N]
     Full Idea: Metaphysical modal logic concerns metaphysical (or alethic) necessity and metaphysical (alethic) possibility, or necessity and possibility tout court - as opposed to such other types of modality as physical necessity, epistemic necessity etc.
     From: Nathan Salmon (The Logic of What Might Have Been [1989], Intro n2)
4. Formal Logic / F. Set Theory ST / 2. Mechanics of Set Theory / a. Symbols of ST
'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)
'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)
'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)
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)
'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 ∈ F. That is, F(x) is the value y which F assumes at x.
     From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], Ch.0)
4. Formal Logic / F. Set Theory ST / 2. Mechanics of Set Theory / b. Terminology of ST
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)
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)
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)
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)
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)
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.
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)
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)
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)
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)
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)
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)
4. Formal Logic / F. Set Theory ST / 3. Types of Set / e. Equivalence classes
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)
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)
5. Theory of Logic / A. Overview of Logic / 1. Overview of Logic
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)
5. Theory of Logic / B. Logical Consequence / 2. Types of Consequence
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.
5. Theory of Logic / I. Semantics of Logic / 3. Logical Truth
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.
5. Theory of Logic / I. Semantics of Logic / 4. Satisfaction
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.
5. Theory of Logic / K. Features of Logics / 3. Soundness
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)
5. Theory of Logic / K. Features of Logics / 4. Completeness
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)
5. Theory of Logic / K. Features of Logics / 6. Compactness
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?
5. Theory of Logic / K. Features of Logics / 7. Decidability
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.
5. Theory of Logic / K. Features of Logics / 8. Enumerability
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.
9. Objects / D. Essence of Objects / 15. Against Essentialism
Any property is attached to anything in some possible world, so I am a radical anti-essentialist [Salmon,N]
     Full Idea: By admitting possible worlds of unlimited variation and recombination, I simply abandon true metaphysical essentialism. By my lights, any property is attached to anything in some possible world or other. I am a closet radical anti-essentialist.
     From: Nathan Salmon (The Logic of What Might Have Been [1989], II)
     A reaction: Salmon includes impossible worlds within his scheme of understanding. It strikes me that this is metaphysical system which tells us nothing about how things are: it is sort of 'logical idealist'. Later he talks of 'we essentialists'.
10. Modality / A. Necessity / 3. Types of Necessity
Logical possibility contains metaphysical possibility, which contains nomological possibility [Salmon,N]
     Full Idea: Just as nomological possibility is a special kind of metaphysical possibility, so metaphysical possibility is a special kind of logical possibility.
     From: Nathan Salmon (The Logic of What Might Have Been [1989], III)
     A reaction: This is the standard view of how the three types of necessity are nested. He gives a possible counterexample in footnote 7.
10. Modality / A. Necessity / 5. Metaphysical Necessity
In the S5 account, nested modalities may be unseen, but they are still there [Salmon,N]
     Full Idea: The S5 theorist's miscontrual of English (in the meaning of 'possibly possible') makes nested modality unseen, but it does not make nested modality vanish. Inaccessible worlds are still worlds.
     From: Nathan Salmon (The Logic of What Might Have Been [1989], IV)
Metaphysical necessity is said to be unrestricted necessity, true in every world whatsoever [Salmon,N]
     Full Idea: It is held that it is the hallmark of metaphysical necessity is that it is completely unrestricted, the limiting case of restricted necessity, with no restrictions whatever. A proposition is necessary only if it is true in absolutely every world whatever.
     From: Nathan Salmon (The Logic of What Might Have Been [1989], II)
     A reaction: This is the standard picture which leads to the claim that S5 modal logic is appropriate for metaphysical necessity, because there are no restrictions on accessibility. Salmon raises objections to this conventional view.
Bizarre identities are logically but not metaphysically possible, so metaphysical modality is restricted [Salmon,N]
     Full Idea: Though there is a way things logically could be according to which I am a credit card account, there is no way things metaphysically might be according to which I am a credit card account. This illustrates the restricted nature of metaphysical modality.
     From: Nathan Salmon (The Logic of What Might Have Been [1989], III)
     A reaction: His drift is that metaphyical modality is restricted, but expressing it in S5 modal logic (where all worlds see one another) makes it unrestricted, so S5 logic is wrong for metaphysics. I'm impressed by his arguments.
Without impossible worlds, the unrestricted modality that is metaphysical has S5 logic [Salmon,N]
     Full Idea: If one confines one's sights to genuinely possible worlds, disavowing the impossible worlds, then metaphysical modality emerges as the limiting case - the 'unrestricted' modality that takes account of 'every' world - and S5 emerges as its proper logic.
     From: Nathan Salmon (The Logic of What Might Have Been [1989], IV)
     A reaction: He observes that this makes metaphysical modality 'restricted' simply because you have restricted what 'all worlds' means. Could there be non-maximal worlds? Are logical and metaphysical modality coextensive? I think I like the S5 view.
Metaphysical necessity is NOT truth in all (unrestricted) worlds; necessity comes first, and is restricted [Salmon,N]
     Full Idea: A mythology gave us the idea that metaphysical necessity is truth in every world whatsoever, without restriction. But the notion of metaphysical modality comes first, and, like every notion of modality, it is restricted.
     From: Nathan Salmon (The Logic of What Might Have Been [1989], IV)
10. Modality / A. Necessity / 6. Logical Necessity
Logical necessity is free of constraints, and may accommodate all of S5 logic [Salmon,N]
     Full Idea: With its freedom from the constraint of metaphysical possibility, logical necessity may be construed as accommodating all the axioms and rules of S5.
     From: Nathan Salmon (The Logic of What Might Have Been [1989], III)
     A reaction: He goes on to raise problems for this simple thought. The big question: what are the limits of what is actually possible? Compare: what are the limits of what is imaginable? what are the limits of what is meaningfully sayable?
10. Modality / A. Necessity / 7. Natural Necessity
Nomological necessity is expressed with intransitive relations in modal semantics [Salmon,N]
     Full Idea: Intransitive relations are introduced into modal semantics for the purposes of interpreting various 'real' or restricted types of modalities, such as nomological necessity.
     From: Nathan Salmon (The Logic of What Might Have Been [1989], II)
     A reaction: The point here is that the (so-called) 'laws of nature' are held to change from world to world, so necessity in one could peter out in some more remote world, rather than being carried over everywhere. A very Humean view of such things.
10. Modality / B. Possibility / 8. Conditionals / f. Pragmatics of conditionals
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)
10. Modality / C. Sources of Modality / 5. Modality from Actuality
Necessity and possibility are not just necessity and possibility according to the actual world [Salmon,N]
     Full Idea: The real meanings of the simple modal terms 'necessary' and 'possible' are not the same as the concepts of actual necessity and actual possibility, necessity and possibility according to the actual world.
     From: Nathan Salmon (The Logic of What Might Have Been [1989], IV)
     A reaction: If you were an 'actualist' (who denies everything except the actual world) then you are unlikely to agree with this. In unrestricted possible worlds, being true in one world makes it possible in all worlds. So actual necessity is possible everywhere.
10. Modality / E. Possible worlds / 1. Possible Worlds / b. Impossible worlds
Impossible worlds are also ways for things to be [Salmon,N]
     Full Idea: Total ways things cannot be are also 'worlds', or maximal ways for things to be. They are impossible worlds.
     From: Nathan Salmon (The Logic of What Might Have Been [1989], I)
     A reaction: This unorthodox view doesn't sound too plausible to me. To think of a circular square as a 'way things could be' sounds pretty empty, and mere playing with words. The number 7 could be the Emperor of China?
Denial of impossible worlds involves two different confusions [Salmon,N]
     Full Idea: Every argument I am aware of against impossible worlds confuses ways for things to be with ways things might have been, or worse, confuses ways things cannot be with ways for things to be that cannot exist - or worse yet, commits both errors.
     From: Nathan Salmon (The Logic of What Might Have Been [1989], III)
     A reaction: He is claiming that 'ways for things to be' allows impossible worlds, whereas 'ways things might have been' appears not to. (I think! Read the paragraph yourself!)
Without impossible worlds, how things might have been is the only way for things to be [Salmon,N]
     Full Idea: If one ignores impossible worlds, then ways things might have been are the only ways for things to be that are left.
     From: Nathan Salmon (The Logic of What Might Have Been [1989], IV)
     A reaction: Impossible worlds are included in 'ways for things to be', but excluded from 'ways things might have been'. I struggle with a circle being square as a 'way for circles to be'. I suppose being the greatest philosopher is a way for me to be.
10. Modality / E. Possible worlds / 1. Possible Worlds / e. Against possible worlds
Possible worlds rely on what might have been, so they can' be used to define or analyse modality [Salmon,N]
     Full Idea: On my conception, the notions of metaphysical necessity and possibility are not defined or analyzed in terms of the apparatus of possible worlds. The order of analysis is just the reverse: possible worlds rely on the notion of what might have been.
     From: Nathan Salmon (The Logic of What Might Have Been [1989], IV)
     A reaction: This view seems to be becoming the new orthodoxy, and I certainly agree with it. I have no idea how you can begin to talk about possible worlds if you don't already have some idea of what 'possible' means.
10. Modality / E. Possible worlds / 2. Nature of Possible Worlds / a. Nature of possible worlds
Possible worlds are maximal abstract ways that things might have been [Salmon,N]
     Full Idea: I conceive of possible worlds as certain sorts of maximal abstract entities according to which certain things (facts, states of affairs) obtain and certain other things do not obtain. They are total ways things might have been.
     From: Nathan Salmon (The Logic of What Might Have Been [1989], I)
Possible worlds just have to be 'maximal', but they don't have to be consistent [Salmon,N]
     Full Idea: As far as I can tell, worlds need not be logically consistent. The only restriction on worlds is that they must be (in some sense) 'maximal' ways for things to be.
     From: Nathan Salmon (The Logic of What Might Have Been [1989], I)
     A reaction: The normal idea of a maximal model is that it must contain either p or ¬p, and not both, so I don't think I understand this thought, but I pass it on.
10. Modality / E. Possible worlds / 2. Nature of Possible Worlds / c. Worlds as propositions
You can't define worlds as sets of propositions, and then define propositions using worlds [Salmon,N]
     Full Idea: It is not a good idea to think of possible worlds as sets of propositions, and at the same time to think of propositions as sets of possible worlds.
     From: Nathan Salmon (The Logic of What Might Have Been [1989], I n3)
     A reaction: Salmon favours thinking of worlds as sets of propositions, and hence rejects the account of propositions as sets of worlds. He favours the 'Russellian' view of propositions, which seem to me to be the same as 'facts'.
23. Ethics / C. Virtue Theory / 3. Virtues / a. Virtues
The six perfections are giving, morality, patience, vigour, meditation, and wisdom [Nagarjuna]
     Full Idea: The six perfections are of giving, morality, patience, vigour, meditation, and wisdom.
     From: Nagarjuna (Mahaprajnaparamitashastra [c.120], 88)
     A reaction: What is 'morality', if giving is not part of it? I like patience and vigour being two of the virtues, which immediately implies an Aristotelian mean (which is always what is 'appropriate').