Combining Texts

All the ideas for 'Mahaprajnaparamitashastra', 'Mathematical Logic (revised)' and 'On the Question of Absolute Undecidability'

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


9 ideas

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 / E. Structures of Logic / 4. Variables in Logic
'Corner quotes' (quasi-quotation) designate 'whatever these terms designate' [Quine]
     Full Idea: A 'quasi-quotation' [corner quotes, Quine quotes] designates that (unspecified) expression which is obtained from the contents of the corners by replacing the Greek letters by the (unspecified) expressions which they designate.
     From: Willard Quine (Mathematical Logic (revised) [1940], 1.6)
     A reaction: Filed under 'variables', as they seem to be variables that can refer to actual expressions, like algebra. Quine was determined to distinguish clearly between 'mention' and 'use'. 'Half-hearted substitutional quantification', says Fine.
5. Theory of Logic / F. Referring in Logic / 1. Naming / f. Names eliminated
We might do without names, by converting them into predicates [Quine, by Kirkham]
     Full Idea: Quine suggests that we can have a language with just predicates and no names. Thus for 'Ralph is red' we say 'x Ralphises and x is red'.
     From: report of Willard Quine (Mathematical Logic (revised) [1940]) by Richard L. Kirkham - Theories of Truth: a Critical Introduction 5.6
     A reaction: Kirkham discusses this as a way of getting round the lack of names in Tarski's theory of truth (which just uses objects, predicates and quantifiers). Otherwise you must supplement Tarski with an account of what the names refer to.
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)
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').