Combining Texts

All the ideas for 'Saundaranandakavya', 'Maths as a Science of Patterns' and 'The Structure of Paradoxes of Self-Reference'

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


19 ideas

1. Philosophy / D. Nature of Philosophy / 2. Invocation to Philosophy
Pursue truth with the urgency of someone whose clothes are on fire [Ashvaghosha]
     Full Idea: As though your turban or your clothes were on fire, so with a sense of urgency should you apply your intellect to the comprehension of the truths.
     From: Ashvaghosha (Saundaranandakavya [c.50], XVI)
     A reaction: The best philosophers need no such urging. I retain a romantic view that we should be 'natural' in these things. See Plato's views in Idea 2153 and 1638. However, maybe I should be confronted with this quotation every morning when I awake.
4. Formal Logic / B. Propositional Logic PL / 2. Tools of Propositional Logic / e. Axioms of PL
Axioms are often affirmed simply because they produce results which have been accepted [Resnik]
     Full Idea: Many axioms have been proposed, not on the grounds that they can be directly known, but rather because they produce a desired body of previously recognised results.
     From: Michael D. Resnik (Maths as a Science of Patterns [1997], One.5.1)
     A reaction: This is the perennial problem with axioms - whether we start from them, or whether we deduce them after the event. There is nothing wrong with that, just as we might infer the existence of quarks because of their results.
5. Theory of Logic / L. Paradox / 1. Paradox
Typically, paradoxes are dealt with by dividing them into two groups, but the division is wrong [Priest,G]
     Full Idea: A natural principle is the same kind of paradox will have the same kind of solution. Standardly Ramsey's first group are solved by denying the existence of some totality, and the second group are less clear. But denial of the groups sink both.
     From: Graham Priest (The Structure of Paradoxes of Self-Reference [1994], §5)
     A reaction: [compressed] This sums up the argument of Priest's paper, which is that it is Ramsey's division into two kinds (see Idea 13334) which is preventing us from getting to grips with the paradoxes. Priest, notoriously, just lives with them.
5. Theory of Logic / L. Paradox / 4. Paradoxes in Logic / b. König's paradox
The 'least indefinable ordinal' is defined by that very phrase [Priest,G]
     Full Idea: König: there are indefinable ordinals, and the least indefinable ordinal has just been defined in that very phrase. (Recall that something is definable iff there is a (non-indexical) noun-phrase that refers to it).
     From: Graham Priest (The Structure of Paradoxes of Self-Reference [1994], §3)
     A reaction: Priest makes great subsequent use of this one, but it feels like a card trick. 'Everything indefinable has now been defined' (by the subject of this sentence)? König, of course, does manage to pick out one particular object.
5. Theory of Logic / L. Paradox / 4. Paradoxes in Logic / c. Berry's paradox
'x is a natural number definable in less than 19 words' leads to contradiction [Priest,G]
     Full Idea: Berry: if we take 'x is a natural number definable in less than 19 words', we can generate a number which is and is not one of these numbers.
     From: Graham Priest (The Structure of Paradoxes of Self-Reference [1994], §3)
     A reaction: [not enough space to spell this one out in full]
5. Theory of Logic / L. Paradox / 4. Paradoxes in Logic / d. Richard's paradox
By diagonalization we can define a real number that isn't in the definable set of reals [Priest,G]
     Full Idea: Richard: φ(x) is 'x is a definable real number between 0 and 1' and ψ(x) is 'x is definable'. We can define a real by diagonalization so that it is not in x. It is and isn't in the set of reals.
     From: Graham Priest (The Structure of Paradoxes of Self-Reference [1994], §3)
     A reaction: [this isn't fully clear here because it is compressed]
5. Theory of Logic / L. Paradox / 5. Paradoxes in Set Theory / c. Burali-Forti's paradox
The least ordinal greater than the set of all ordinals is both one of them and not one of them [Priest,G]
     Full Idea: Burali-Forti: φ(x) is 'x is an ordinal', and so w is the set of all ordinals, On; δ(x) is the least ordinal greater than every member of x (abbreviation: log(x)). The contradiction is that log(On)∈On and log(On)∉On.
     From: Graham Priest (The Structure of Paradoxes of Self-Reference [1994], §2)
5. Theory of Logic / L. Paradox / 5. Paradoxes in Set Theory / e. Mirimanoff's paradox
The next set up in the hierarchy of sets seems to be both a member and not a member of it [Priest,G]
     Full Idea: Mirimanoff: φ(x) is 'x is well founded', so that w is the cumulative hierarchy of sets, V; &delta(x) is just the power set of x, P(x). If x⊆V, then V∈V and V∉V, since δ(V) is just V itself.
     From: Graham Priest (The Structure of Paradoxes of Self-Reference [1994], §2)
5. Theory of Logic / L. Paradox / 6. Paradoxes in Language / a. The Liar paradox
If you know that a sentence is not one of the known sentences, you know its truth [Priest,G]
     Full Idea: In the family of the Liar is the Knower Paradox, where φ(x) is 'x is known to be true', and there is a set of known things, Kn. By knowing a sentence is not in the known sentences, you know its truth.
     From: Graham Priest (The Structure of Paradoxes of Self-Reference [1994], §4)
     A reaction: [mostly my wording]
There are Liar Pairs, and Liar Chains, which fit the same pattern as the basic Liar [Priest,G]
     Full Idea: There are liar chains which fit the pattern of Transcendence and Closure, as can be seen with the simplest case of the Liar Pair.
     From: Graham Priest (The Structure of Paradoxes of Self-Reference [1994], §4)
     A reaction: [Priest gives full details] Priest's idea is that Closure is when a set is announced as complete, and Transcendence is when the set is forced to expand. He claims that the two keep coming into conflict.
6. Mathematics / A. Nature of Mathematics / 1. Mathematics
Mathematical realism says that maths exists, is largely true, and is independent of proofs [Resnik]
     Full Idea: Mathematical realism is the doctrine that mathematical objects exist, that much contemporary mathematics is true, and that the existence and truth in question is independent of our constructions, beliefs and proofs.
     From: Michael D. Resnik (Maths as a Science of Patterns [1997], Three.12.9)
     A reaction: As thus defined, I would call myself a mathematical realist, but everyone must hesitate a little at the word 'exist' and ask, how does it exist? What is it 'made of'? To say that it exists in the way that patterns exist strikes me as very helpful.
6. Mathematics / B. Foundations for Mathematics / 7. Mathematical Structuralism / a. Structuralism
Mathematical constants and quantifiers only exist as locations within structures or patterns [Resnik]
     Full Idea: In maths the primary subject-matter is not mathematical objects but structures in which they are arranged; our constants and quantifiers denote atoms, structureless points, or positions in structures; they have no identity outside a structure or pattern.
     From: Michael D. Resnik (Maths as a Science of Patterns [1997], Three.10.1)
     A reaction: This seems to me a very promising idea for the understanding of mathematics. All mathematicians acknowledge that the recognition of patterns is basic to the subject. Even animals recognise patterns. It is natural to invent a language of patterns.
Sets are positions in patterns [Resnik]
     Full Idea: On my view, sets are positions in certain patterns.
     From: Michael D. Resnik (Maths as a Science of Patterns [1997], Three.10.5)
     A reaction: I have always found the ontology of a 'set' puzzling, because they seem to depend on prior reasons why something is a member of a given set, which cannot always be random. It is hard to explain sets without mentioning properties.
6. Mathematics / B. Foundations for Mathematics / 7. Mathematical Structuralism / d. Platonist structuralism
Structuralism must explain why a triangle is a whole, and not a random set of points [Resnik]
     Full Idea: An objection is that structuralism fails to explain why certain mathematical patterns are unified wholes while others are not; for instance, some think that an ontological account of mathematics must explain why a triangle is not a 'random' set of points.
     From: Michael D. Resnik (Maths as a Science of Patterns [1997], Three.10.4)
     A reaction: This is an indication that we are not just saying that we recognise patterns in nature, but that we also 'see' various underlying characteristics of the patterns. The obvious suggestion is that we see meta-patterns.
There are too many mathematical objects for them all to be mental or physical [Resnik]
     Full Idea: If we take mathematics at its word, there are too many mathematical objects for it to be plausible that they are all mental or physical objects.
     From: Michael D. Resnik (Maths as a Science of Patterns [1997], One.1)
     A reaction: No one, of course, has ever claimed that they are, but this is a good starting point for assessing the ontology of mathematics. We are going to need 'rules', which can deduce the multitudinous mathematical objects from a small ontology.
Maths is pattern recognition and representation, and its truth and proofs are based on these [Resnik]
     Full Idea: I argue that mathematical knowledge has its roots in pattern recognition and representation, and that manipulating representations of patterns provides the connection between the mathematical proof and mathematical truth.
     From: Michael D. Resnik (Maths as a Science of Patterns [1997], One.1)
     A reaction: The suggestion that patterns are at the basis of the ontology of mathematics is the most illuminating thought I have encountered in the area. It immediately opens up the possibility of maths being an entirely empirical subject.
Congruence is the strongest relationship of patterns, equivalence comes next, and mutual occurrence is the weakest [Resnik]
     Full Idea: Of the equivalence relationships which occur between patterns, congruence is the strongest, equivalence the next, and mutual occurrence the weakest. None of these is identity, which would require the same position.
     From: Michael D. Resnik (Maths as a Science of Patterns [1997], Three.10.3)
     A reaction: This gives some indication of how an account of mathematics as a science of patterns might be built up. Presumably the recognition of these 'degrees of strength' cannot be straightforward observation, but will need an a priori component?
29. Religion / C. Spiritual Disciplines / 3. Buddhism
The Eightfold Path concerns morality, wisdom, and tranquillity [Ashvaghosha]
     Full Idea: The Eightfold Path has three steps concerning morality - right speech, right bodily action, and right livelihood; three of wisdom - right views, right intentions, and right effort; and two of tranquillity - right mindfulness and right concentration.
     From: Ashvaghosha (Saundaranandakavya [c.50], XVI)
     A reaction: Most of this translates quite comfortably into the aspirations of western philosophy. For example, 'right effort' sounds like Kant's claim that only a good will is truly good (Idea 3710). The Buddhist division is interesting for action theory.
29. Religion / D. Religious Issues / 2. Immortality / d. Heaven
At the end of a saint, he is not located in space, but just ceases to be disturbed [Ashvaghosha]
     Full Idea: When an accomplished saint comes to the end, he does not go anywhere down in the earth or up in the sky, nor into any of the directions of space, but because his defilements have become extinct he simply ceases to be disturbed.
     From: Ashvaghosha (Saundaranandakavya [c.50], XVI)
     A reaction: To 'cease to be disturbed' is the most attractive account of heaven I have encountered. It all sounds a bit dull though. I wonder, as usual, how they know all this stuff.