Combining Texts

All the ideas for 'On the Question of Absolute Undecidability', 'Explanations in reply to Mr Bradley' and 'The Birth of Tragedy'

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


8 ideas

1. Philosophy / D. Nature of Philosophy / 1. Philosophy
Philosophy begins in the horror and absurdity of existence [Nietzsche, by Ansell Pearson]
     Full Idea: For Nietzsche philosophy begins in horror - existence is something both horrible and absurd.
     From: report of Friedrich Nietzsche (The Birth of Tragedy [1871]) by Keith Ansell Pearson - How to Read Nietzsche Ch.1
     A reaction: A striking contrast to Aristotle (Idea 549). Personally I think my philosophy begins with confusion. Not that I endorse a Wittgenteinian view, that we are just trying to cure ourselves of self-inflicted wounds. Life is very complex and we are bit simple.
1. Philosophy / D. Nature of Philosophy / 5. Aims of Philosophy / a. Philosophy as worldly
Philosophers should be more inductive, and test results by their conclusions, not their self-evidence [Russell]
     Full Idea: The progress of philosophy seems to demand that, like science, it should learn to practise induction, to test its premisses by the conclusions to which they lead, and not merely by their apparent self-evidence.
     From: Bertrand Russell (Explanations in reply to Mr Bradley [1899], nr end)
     A reaction: [from Twitter] Love this. It is 'one person's modus ponens is another person's modus tollens'. I think all philosophical conclusions, without exception, should be reached by evaluating the final result fully, and not just following a line of argument.
4. Formal Logic / F. Set Theory ST / 1. Set Theory
Mathematical set theory has many plausible stopping points, such as finitism, and predicativism [Koellner]
     Full Idea: There are many coherent stopping points in the hierarchy of increasingly strong mathematical systems, starting with strict finitism, and moving up through predicativism to the higher reaches of set theory.
     From: Peter Koellner (On the Question of Absolute Undecidability [2006], Intro)
'Reflection principles' say the whole truth about sets can't be captured [Koellner]
     Full Idea: Roughly speaking, 'reflection principles' assert that anything true in V [the set hierarchy] falls short of characterising V in that it is true within some earlier level.
     From: Peter Koellner (On the Question of Absolute Undecidability [2006], 2.1)
5. Theory of Logic / K. Features of Logics / 5. Incompleteness
We have no argument to show a statement is absolutely undecidable [Koellner]
     Full Idea: There is at present no solid argument to the effect that a given statement is absolutely undecidable.
     From: Peter Koellner (On the Question of Absolute Undecidability [2006], 5.3)
6. Mathematics / A. Nature of Mathematics / 5. The Infinite / i. Cardinal infinity
There are at least eleven types of large cardinal, of increasing logical strength [Koellner]
     Full Idea: Some of the standard large cardinals (in order of increasing (logical) strength) are: inaccessible, Mahlo, weakly compact, indescribable, Erdös, measurable, strong, Wodin, supercompact, huge etc. (...and ineffable).
     From: Peter Koellner (On the Question of Absolute Undecidability [2006], 1.4)
     A reaction: [I don't understand how cardinals can have 'logical strength', but I pass it on anyway]
6. Mathematics / B. Foundations for Mathematics / 4. Axioms for Number / d. Peano arithmetic
PA is consistent as far as we can accept, and we expand axioms to overcome limitations [Koellner]
     Full Idea: To the extent that we are justified in accepting Peano Arithmetic we are justified in accepting its consistency, and so we know how to expand the axiom system so as to overcome the limitation [of Gödel's Second Theorem].
     From: Peter Koellner (On the Question of Absolute Undecidability [2006], 1.1)
     A reaction: Each expansion brings a limitation, but then you can expand again.
6. Mathematics / B. Foundations for Mathematics / 4. Axioms for Number / g. Incompleteness of Arithmetic
Arithmetical undecidability is always settled at the next stage up [Koellner]
     Full Idea: The arithmetical instances of undecidability that arise at one stage of the hierarchy are settled at the next.
     From: Peter Koellner (On the Question of Absolute Undecidability [2006], 1.4)