Combining Texts

All the ideas for 'Mahaprajnaparamitashastra', 'What Required for Foundation for Maths?' and 'Philosophy of Mathematics'

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


81 ideas

2. Reason / D. Definition / 2. Aims of Definition
Definitions make our intuitions mathematically useful [Mayberry]
     Full Idea: Definition provides us with the means for converting our intuitions into mathematically usable concepts.
     From: John Mayberry (What Required for Foundation for Maths? [1994], p.405-1)
2. Reason / D. Definition / 8. Impredicative Definition
Impredicative definitions are wrong, because they change the set that is being defined? [Bostock]
     Full Idea: Poincaré suggested that what is wrong with an impredicative definition is that it allows the set defined to alter its composition as more sets are added to the theory.
     From: David Bostock (Philosophy of Mathematics [2009], 8.3)
2. Reason / E. Argument / 6. Conclusive Proof
Proof shows that it is true, but also why it must be true [Mayberry]
     Full Idea: When you have proved something you know not only that it is true, but why it must be true.
     From: John Mayberry (What Required for Foundation for Maths? [1994], p.405-2)
     A reaction: Note the word 'must'. Presumably both the grounding and the necessitation of the truth are revealed.
4. Formal Logic / E. Nonclassical Logics / 2. Intuitionist Logic
Classical interdefinitions of logical constants and quantifiers is impossible in intuitionism [Bostock]
     Full Idea: None of the classical ways of defining one logical constant in terms of others is available in intuitionist logic (and this includes the two quantifiers).
     From: David Bostock (Philosophy of Mathematics [2009], 7.2)
4. Formal Logic / F. Set Theory ST / 1. Set Theory
There is no single agreed structure for set theory [Bostock]
     Full Idea: There is so far no agreed set of axioms for set theory which is categorical, i.e. which does pick just one structure.
     From: David Bostock (Philosophy of Mathematics [2009], 6.4)
     A reaction: This contrasts with Peano Arithmetic, which is categorical in its second-order version.
4. Formal Logic / F. Set Theory ST / 3. Types of Set / a. Types of set
A 'proper class' cannot be a member of anything [Bostock]
     Full Idea: A 'proper class' cannot be a member of anything, neither of a set nor of another proper class.
     From: David Bostock (Philosophy of Mathematics [2009], 5.4)
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / a. Axioms for sets
We could add axioms to make sets either as small or as large as possible [Bostock]
     Full Idea: We could add the axiom that all sets are constructible (V = L), making the universe of sets as small as possible, or add the axiom that there is a supercompact cardinal (SC), making the universe as large as we no know how to.
     From: David Bostock (Philosophy of Mathematics [2009], 6.4)
     A reaction: Bostock says most mathematicians reject the first option, and are undecided about the second option.
Set theory can't be axiomatic, because it is needed to express the very notion of axiomatisation [Mayberry]
     Full Idea: Set theory cannot be an axiomatic theory, because the very notion of an axiomatic theory makes no sense without it.
     From: John Mayberry (What Required for Foundation for Maths? [1994], p.413-2)
     A reaction: This will come as a surprise to Penelope Maddy, who battles with ways to accept the set theory axioms as the foundation of mathematics. Mayberry says that the basic set theory required is much more simple and intuitive.
There is a semi-categorical axiomatisation of set-theory [Mayberry]
     Full Idea: We can give a semi-categorical axiomatisation of set-theory (all that remains undetermined is the size of the set of urelements and the length of the sequence of ordinals). The system is second-order in formalisation.
     From: John Mayberry (What Required for Foundation for Maths? [1994], p.413-2)
     A reaction: I gather this means the models may not be isomorphic to one another (because they differ in size), but can be shown to isomorphic to some third ingredient. I think. Mayberry says this shows there is no such thing as non-Cantorian set theory.
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / f. Axiom of Infinity V
The misnamed Axiom of Infinity says the natural numbers are finite in size [Mayberry]
     Full Idea: The (misnamed!) Axiom of Infinity expresses Cantor's fundamental assumption that the species of natural numbers is finite in size.
     From: John Mayberry (What Required for Foundation for Maths? [1994], p.414-2)
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / j. Axiom of Choice IX
The Axiom of Choice relies on reference to sets that we are unable to describe [Bostock]
     Full Idea: The usual accounts of ZF are not restricted to subsets that we can describe, and that is what justifies the axiom of choice.
     From: David Bostock (Philosophy of Mathematics [2009], 8.4 n36)
     A reaction: This contrasts interestingly with predicativism, which says we can only discuss things which we can describe or define. Something like verificationism hovers in the background.
4. Formal Logic / F. Set Theory ST / 5. Conceptions of Set / e. Iterative sets
The set hierarchy doesn't rely on the dubious notion of 'generating' them [Mayberry]
     Full Idea: The idea of 'generating' sets is only a metaphor - the existence of the hierarchy is established without appealing to such dubious notions.
     From: John Mayberry (What Required for Foundation for Maths? [1994], p.414-2)
     A reaction: Presumably there can be a 'dependence' or 'determination' relation which does not involve actual generation.
4. Formal Logic / F. Set Theory ST / 5. Conceptions of Set / f. Limitation of Size
Replacement enforces a 'limitation of size' test for the existence of sets [Bostock]
     Full Idea: The Axiom of Replacement (or the Axiom of Subsets, 'Aussonderung', Fraenkel 1922) in effect enforces the idea that 'limitation of size' is a crucial factor when deciding whether a proposed set or does not not exist.
     From: David Bostock (Philosophy of Mathematics [2009], 5.4)
Limitation of size is part of the very conception of a set [Mayberry]
     Full Idea: Our very notion of a set is that of an extensional plurality limited in size.
     From: John Mayberry (What Required for Foundation for Maths? [1994], p.415-2)
5. Theory of Logic / A. Overview of Logic / 2. History of Logic
The mainstream of modern logic sees it as a branch of mathematics [Mayberry]
     Full Idea: In the mainstream tradition of modern logic, beginning with Boole, Peirce and Schröder, descending through Löwenheim and Skolem to reach maturity with Tarski and his school ...saw logic as a branch of mathematics.
     From: John Mayberry (What Required for Foundation for Maths? [1994], p.410-1)
     A reaction: [The lesser tradition, of Frege and Russell, says mathematics is a branch of logic]. Mayberry says the Fregean tradition 'has almost died out'.
5. Theory of Logic / A. Overview of Logic / 5. First-Order Logic
First-order logic is not decidable: there is no test of whether any formula is valid [Bostock]
     Full Idea: First-order logic is not decidable. That is, there is no test which can be applied to any arbitrary formula of that logic and which will tell one whether the formula is or is not valid (as proved by Church in 1936).
     From: David Bostock (Philosophy of Mathematics [2009], 5.5)
The completeness of first-order logic implies its compactness [Bostock]
     Full Idea: From the fact that the usual rules for first-level logic are complete (as proved by Gödel 1930), it follows that this logic is 'compact'.
     From: David Bostock (Philosophy of Mathematics [2009], 5.5)
     A reaction: The point is that the completeness requires finite proofs.
First-order logic only has its main theorems because it is so weak [Mayberry]
     Full Idea: First-order logic is very weak, but therein lies its strength. Its principle tools (Compactness, Completeness, Löwenheim-Skolem Theorems) can be established only because it is too weak to axiomatize either arithmetic or analysis.
     From: John Mayberry (What Required for Foundation for Maths? [1994], p.411-2)
     A reaction: He adds the proviso that this is 'unless we are dealing with structures on whose size we have placed an explicit, finite bound' (p.412-1).
5. Theory of Logic / A. Overview of Logic / 7. Second-Order Logic
Only second-order logic can capture mathematical structure up to isomorphism [Mayberry]
     Full Idea: Second-order logic is a powerful tool of definition: by means of it alone we can capture mathematical structure up to isomorphism using simple axiom systems.
     From: John Mayberry (What Required for Foundation for Maths? [1994], p.412-1)
5. Theory of Logic / G. Quantification / 2. Domain of Quantification
Big logic has one fixed domain, but standard logic has a domain for each interpretation [Mayberry]
     Full Idea: The 'logica magna' [of the Fregean tradition] has quantifiers ranging over a fixed domain, namely everything there is. In the Boolean tradition the domains differ from interpretation to interpretation.
     From: John Mayberry (What Required for Foundation for Maths? [1994], p.410-2)
     A reaction: Modal logic displays both approaches, with different systems for global and local domains.
5. Theory of Logic / G. Quantification / 4. Substitutional Quantification
Substitutional quantification is just standard if all objects in the domain have a name [Bostock]
     Full Idea: Substitutional quantification and quantification understood in the usual 'ontological' way will coincide when every object in the (ontological) domain has a name.
     From: David Bostock (Philosophy of Mathematics [2009], 7.3 n23)
5. Theory of Logic / H. Proof Systems / 4. Natural Deduction
The Deduction Theorem is what licenses a system of natural deduction [Bostock]
     Full Idea: The Deduction Theorem is what licenses a system of 'natural deduction' in the first place.
     From: David Bostock (Philosophy of Mathematics [2009], 7.2)
5. Theory of Logic / J. Model Theory in Logic / 3. Löwenheim-Skolem Theorems
No Löwenheim-Skolem logic can axiomatise real analysis [Mayberry]
     Full Idea: No logic which can axiomatize real analysis can have the Löwenheim-Skolem property.
     From: John Mayberry (What Required for Foundation for Maths? [1994], p.412-1)
5. Theory of Logic / K. Features of Logics / 1. Axiomatisation
'Classificatory' axioms aim at revealing similarity in morphology of structures [Mayberry]
     Full Idea: The purpose of a 'classificatory' axiomatic theory is to single out an otherwise disparate species of structures by fixing certain features of morphology. ...The aim is to single out common features.
     From: John Mayberry (What Required for Foundation for Maths? [1994], p.406-2)
Axiomatiation relies on isomorphic structures being essentially the same [Mayberry]
     Full Idea: The central dogma of the axiomatic method is this: isomorphic structures are mathematically indistinguishable in their essential properties.
     From: John Mayberry (What Required for Foundation for Maths? [1994], p.406-2)
     A reaction: Hence it is not that we have to settle for the success of a system 'up to isomorphism', since that was the original aim. The structures must differ in their non-essential properties, or they would be the same system.
'Eliminatory' axioms get rid of traditional ideal and abstract objects [Mayberry]
     Full Idea: The purpose of what I am calling 'eliminatory' axiomatic theories is precisely to eliminate from mathematics those peculiar ideal and abstract objects that, on the traditional view, constitute its subject matter.
     From: John Mayberry (What Required for Foundation for Maths? [1994], p.407-1)
     A reaction: A very interesting idea. I have a natural antipathy to 'abstract objects', because they really mess up what could otherwise be a very tidy ontology. What he describes might be better called 'ignoring' axioms. The objects may 'exist', but who cares?
5. Theory of Logic / K. Features of Logics / 6. Compactness
No logic which can axiomatise arithmetic can be compact or complete [Mayberry]
     Full Idea: No logic which can axiomatise arithmetic can be compact or complete.
     From: John Mayberry (What Required for Foundation for Maths? [1994], p.412-1)
     A reaction: I take this to be because there are new truths in the transfinite level (as well as the problem of incompleteness).
5. Theory of Logic / L. Paradox / 4. Paradoxes in Logic / c. Berry's paradox
Berry's Paradox considers the meaning of 'The least number not named by this name' [Bostock]
     Full Idea: Berry's Paradox can be put in this form, by considering the alleged name 'The least number not named by this name'.
     From: David Bostock (Philosophy of Mathematics [2009], 8.1)
6. Mathematics / A. Nature of Mathematics / 3. Nature of Numbers / b. Types of number
Each addition changes the ordinality but not the cardinality, prior to aleph-1 [Bostock]
     Full Idea: If you add to the ordinals you produce many different ordinals, each measuring the length of the sequence of ordinals less than it. They each have cardinality aleph-0. The cardinality eventually increases, but we can't say where this break comes.
     From: David Bostock (Philosophy of Mathematics [2009], 4.5)
ω + 1 is a new ordinal, but its cardinality is unchanged [Bostock]
     Full Idea: If we add ω onto the end of 0,1,2,3,4..., it then has a different length, of ω+1. It has a different ordinal (since it can't be matched with its first part), but the same cardinal (since adding 1 makes no difference).
     From: David Bostock (Philosophy of Mathematics [2009], 4.5)
     A reaction: [compressed] The ordinals and cardinals coincide up to ω, but this is the point at which they come apart.
6. Mathematics / A. Nature of Mathematics / 3. Nature of Numbers / c. Priority of numbers
A cardinal is the earliest ordinal that has that number of predecessors [Bostock]
     Full Idea: It is the usual procedure these days to identify a cardinal number with the earliest ordinal number that has that number of predecessors.
     From: David Bostock (Philosophy of Mathematics [2009], 4.5)
     A reaction: This sounds circular, since you need to know the cardinal in order to decide which ordinal is the one you want, but, hey, what do I know?
6. Mathematics / A. Nature of Mathematics / 3. Nature of Numbers / f. Cardinal numbers
Aleph-1 is the first ordinal that exceeds aleph-0 [Bostock]
     Full Idea: The cardinal aleph-1 is identified with the first ordinal to have more than aleph-0 members, and so on.
     From: David Bostock (Philosophy of Mathematics [2009], 5.4)
     A reaction: That is, the succeeding infinite ordinals all have the same cardinal number of members (aleph-0), until the new total is triggered (at the number of the reals). This is Continuum Hypothesis territory.
6. Mathematics / A. Nature of Mathematics / 3. Nature of Numbers / g. Real numbers
Instead of by cuts or series convergence, real numbers could be defined by axioms [Bostock]
     Full Idea: In addition to cuts, or converging series, Cantor suggests we can simply lay down a set of axioms for the real numbers, and this can be done without any explicit mention of the rational numbers [note: the axioms are those for a complete ordered field].
     From: David Bostock (Philosophy of Mathematics [2009], 4.4)
     A reaction: It is interesting when axioms are best, and when not. Set theory depends entirely on axioms. Horsten and Halbach are now exploring treating truth as axiomatic. You don't give the 'nature' of the thing - just rules for its operation.
The number of reals is the number of subsets of the natural numbers [Bostock]
     Full Idea: It is not difficult to show that the number of the real numbers is the same as the number of all the subsets of the natural numbers.
     From: David Bostock (Philosophy of Mathematics [2009], 4.5)
     A reaction: The Continuum Hypothesis is that this is the next infinite number after the number of natural numbers. Why can't there be a number which is 'most' of the subsets of the natural numbers?
Real numbers can be eliminated, by axiom systems for complete ordered fields [Mayberry]
     Full Idea: We eliminate the real numbers by giving an axiomatic definition of the species of complete ordered fields. These axioms are categorical (mutually isomorphic), and thus are mathematically indistinguishable.
     From: John Mayberry (What Required for Foundation for Maths? [1994], p.408-2)
     A reaction: Hence my clever mathematical friend says that it is a terrible misunderstanding to think that mathematics is about numbers. Mayberry says the reals are one ordered field, but mathematics now studies all ordered fields together.
6. Mathematics / A. Nature of Mathematics / 3. Nature of Numbers / i. Reals from cuts
For Eudoxus cuts in rationals are unique, but not every cut makes a real number [Bostock]
     Full Idea: As Eudoxus claimed, two distinct real numbers cannot both make the same cut in the rationals, for any two real numbers must be separated by a rational number. He did not say, though, that for every such cut there is a real number that makes it.
     From: David Bostock (Philosophy of Mathematics [2009], 4.4)
     A reaction: This is in Bostock's discussion of Dedekind's cuts. It seems that every cut is guaranteed to produce a real. Fine challenges the later assumption.
6. Mathematics / A. Nature of Mathematics / 4. Using Numbers / b. Quantity
Greek quantities were concrete, and ratio and proportion were their science [Mayberry]
     Full Idea: Quantities for Greeks were concrete things - lines, surfaces, solids, times, weights. At the centre of their science of quantity was the beautiful theory of ratio and proportion (...in which the notion of number does not appear!).
     From: John Mayberry (What Required for Foundation for Maths? [1994], p.407-2)
     A reaction: [He credits Eudoxus, and cites Book V of Euclid]
Real numbers were invented, as objects, to simplify and generalise 'quantity' [Mayberry]
     Full Idea: The abstract objects of modern mathematics, the real numbers, were invented by the mathematicians of the seventeenth century in order to simplify and to generalize the Greek science of quantity.
     From: John Mayberry (What Required for Foundation for Maths? [1994], p.407-2)
6. Mathematics / A. Nature of Mathematics / 5. The Infinite / a. The Infinite
Cantor's infinite is an absolute, of all the sets or all the ordinal numbers [Mayberry]
     Full Idea: In Cantor's new vision, the infinite, the genuine infinite, does not disappear, but presents itself in the guise of the absolute, as manifested in the species of all sets or the species of all ordinal numbers.
     From: John Mayberry (What Required for Foundation for Maths? [1994], p.414-2)
Cantor extended the finite (rather than 'taming the infinite') [Mayberry]
     Full Idea: We may describe Cantor's achievement by saying, not that he tamed the infinite, but that he extended the finite.
     From: John Mayberry (What Required for Foundation for Maths? [1994], p.414-2)
6. Mathematics / A. Nature of Mathematics / 5. The Infinite / k. Infinitesimals
Infinitesimals are not actually contradictory, because they can be non-standard real numbers [Bostock]
     Full Idea: Non-standard natural numbers will yield non-standard rational and real numbers. These will include reciprocals which will be closer to 0 than any standard real number. These are like 'infinitesimals', so that notion is not actually a contradiction.
     From: David Bostock (Philosophy of Mathematics [2009], 5.5)
6. Mathematics / B. Foundations for Mathematics / 1. Foundations for Mathematics
The ultimate principles and concepts of mathematics are presumed, or grasped directly [Mayberry]
     Full Idea: The ultimate principles upon which mathematics rests are those to which mathematicians appeal without proof; and the primitive concepts of mathematics ...themselves are grasped directly, if grasped at all, without the mediation of definition.
     From: John Mayberry (What Required for Foundation for Maths? [1994], p.405-1)
     A reaction: This begs the question of whether the 'grasping' is purely a priori, or whether it derives from experience. I defend the latter, and Jenkins puts the case well.
Foundations need concepts, definition rules, premises, and proof rules [Mayberry]
     Full Idea: An account of the foundations of mathematics must specify four things: the primitive concepts for use in definitions, the rules governing definitions, the ultimate premises of proofs, and rules allowing advance from premises to conclusions.
     From: John Mayberry (What Required for Foundation for Maths? [1994], p.405-2)
Axiom theories can't give foundations for mathematics - that's using axioms to explain axioms [Mayberry]
     Full Idea: No axiomatic theory, formal or informal, of first or of higher order can logically play a foundational role in mathematics. ...It is obvious that you cannot use the axiomatic method to explain what the axiomatic method is.
     From: John Mayberry (What Required for Foundation for Maths? [1994], p.415-2)
If proof and definition are central, then mathematics needs and possesses foundations [Mayberry]
     Full Idea: If we grant, as surely we must, the central importance of proof and definition, then we must also grant that mathematics not only needs, but in fact has, foundations.
     From: John Mayberry (What Required for Foundation for Maths? [1994], p.405-1)
6. Mathematics / B. Foundations for Mathematics / 3. Axioms for Geometry
Modern axioms of geometry do not need the real numbers [Bostock]
     Full Idea: A modern axiomatisation of geometry, such as Hilbert's (1899), does not need to claim the existence of real numbers anywhere in its axioms.
     From: David Bostock (Philosophy of Mathematics [2009], 9.B.5.ii)
     A reaction: This is despite the fact that geometry is reduced to algebra, and the real numbers are the equivalent of continuous lines. Bostock votes for a Greek theory of proportion in this role.
6. Mathematics / B. Foundations for Mathematics / 4. Axioms for Number / d. Peano arithmetic
The Peano Axioms describe a unique structure [Bostock]
     Full Idea: The Peano Axioms are categorical, meaning that they describe a unique structure.
     From: David Bostock (Philosophy of Mathematics [2009], 4.4 n20)
     A reaction: So if you think there is nothing more to the natural numbers than their structure, then the Peano Axioms give the essence of arithmetic. If you think that 'objects' must exist to generate a structure, there must be more to the numbers.
1st-order PA is only interesting because of results which use 2nd-order PA [Mayberry]
     Full Idea: The sole theoretical interest of first-order Peano arithmetic derives from the fact that it is a first-order reduct of a categorical second-order theory. Its axioms can be proved incomplete only because the second-order theory is categorical.
     From: John Mayberry (What Required for Foundation for Maths? [1994], p.412-1)
6. Mathematics / B. Foundations for Mathematics / 4. Axioms for Number / g. Incompleteness of Arithmetic
It is only 2nd-order isomorphism which suggested first-order PA completeness [Mayberry]
     Full Idea: If we did not know that the second-order axioms characterise the natural numbers up to isomorphism, we should have no reason to suppose, a priori, that first-order Peano Arithmetic should be complete.
     From: John Mayberry (What Required for Foundation for Maths? [1994], p.412-1)
6. Mathematics / B. Foundations for Mathematics / 5. Definitions of Number / d. Hume's Principle
Hume's Principle is a definition with existential claims, and won't explain numbers [Bostock]
     Full Idea: Hume's Principle will not do as an implicit definition because it makes a positive claim about the size of the universe (which no mere definition can do), and because it does not by itself explain what the numbers are.
     From: David Bostock (Philosophy of Mathematics [2009], 9.A.2)
Many things will satisfy Hume's Principle, so there are many interpretations of it [Bostock]
     Full Idea: Hume's Principle gives a criterion of identity for numbers, but it is obvious that many other things satisfy that criterion. The simplest example is probably the numerals (in any notation, decimal, binary etc.), giving many different interpretations.
     From: David Bostock (Philosophy of Mathematics [2009], 9.A.2)
There are many criteria for the identity of numbers [Bostock]
     Full Idea: There is not just one way of giving a criterion of identity for numbers.
     From: David Bostock (Philosophy of Mathematics [2009], 9.A.2)
6. Mathematics / B. Foundations for Mathematics / 5. Definitions of Number / e. Caesar problem
Frege makes numbers sets to solve the Caesar problem, but maybe Caesar is a set! [Bostock]
     Full Idea: The Julius Caesar problem was one reason that led Frege to give an explicit definition of numbers as special sets. He does not appear to notice that the same problem affects his Axiom V for introducing sets (whether Caesar is or is not a set).
     From: David Bostock (Philosophy of Mathematics [2009], 9.A.2)
     A reaction: The Julius Caesar problem is a sceptical acid that eats into everything in philosophy of mathematics. You give all sorts of wonderful accounts of numbers, but at what point do you know that you now have a number, and not something else?
6. Mathematics / B. Foundations for Mathematics / 6. Mathematics as Set Theory / a. Mathematics is set theory
Set theory is not just first-order ZF, because that is inadequate for mathematics [Mayberry]
     Full Idea: The idea that set theory must simply be identified with first-order Zermelo-Fraenkel is surprisingly widespread. ...The first-order axiomatic theory of sets is clearly inadequate as a foundation of mathematics.
     From: John Mayberry (What Required for Foundation for Maths? [1994], p.412-2)
     A reaction: [He is agreeing with a quotation from Skolem].
We don't translate mathematics into set theory, because it comes embodied in that way [Mayberry]
     Full Idea: One does not have to translate 'ordinary' mathematics into the Zermelo-Fraenkel system: ordinary mathematics comes embodied in that system.
     From: John Mayberry (What Required for Foundation for Maths? [1994], p.415-1)
     A reaction: Mayberry seems to be a particular fan of set theory as spelling out the underlying facts of mathematics, though it has to be second-order.
Set theory is not just another axiomatised part of mathematics [Mayberry]
     Full Idea: The fons et origo of all confusion is the view that set theory is just another axiomatic theory and the universe of sets just another mathematical structure. ...The universe of sets ...is the world that all mathematical structures inhabit.
     From: John Mayberry (What Required for Foundation for Maths? [1994], p.416-1)
6. Mathematics / B. Foundations for Mathematics / 7. Mathematical Structuralism / e. Structuralism critique
Numbers can't be positions, if nothing decides what position a given number has [Bostock]
     Full Idea: There is no ground for saying that a number IS a position, if the truth is that there is nothing to determine which number is which position.
     From: David Bostock (Philosophy of Mathematics [2009], 6.4)
     A reaction: If numbers lose touch with the empirical ability to count physical objects, they drift off into a mad world where they crumble away.
Structuralism falsely assumes relations to other numbers are numbers' only properties [Bostock]
     Full Idea: Structuralism begins from a false premise, namely that numbers have no properties other than their relations to other numbers.
     From: David Bostock (Philosophy of Mathematics [2009], 6.5)
     A reaction: Well said. Describing anything purely relationally strikes me as doomed, because you have to say why those things relate in those ways.
6. Mathematics / C. Sources of Mathematics / 3. Mathematical Nominalism
Nominalism about mathematics is either reductionist, or fictionalist [Bostock]
     Full Idea: Nominalism has two main versions, one which tries to 'reduce' the objects of mathematics to something simpler (Russell and Wittgenstein), and another which claims that such objects are mere 'fictions' which have no reality (Field).
     From: David Bostock (Philosophy of Mathematics [2009], 9)
Nominalism as based on application of numbers is no good, because there are too many applications [Bostock]
     Full Idea: The style of nominalism which aims to reduce statements about numbers to statements about their applications does not work for the natural numbers, because they have many applications, and it is arbitrary to choose just one of them.
     From: David Bostock (Philosophy of Mathematics [2009], 9.B.5.iii)
6. Mathematics / C. Sources of Mathematics / 4. Mathematical Empiricism / b. Indispensability of mathematics
Actual measurement could never require the precision of the real numbers [Bostock]
     Full Idea: We all know that in practice no physical measurement can be 100 per cent accurate, and so it cannot require the existence of a genuinely irrational number, rather than some of the rational numbers close to it.
     From: David Bostock (Philosophy of Mathematics [2009], 9.A.3)
6. Mathematics / C. Sources of Mathematics / 5. Numbers as Adjectival
Ordinals are mainly used adjectively, as in 'the first', 'the second'... [Bostock]
     Full Idea: The basic use of the ordinal numbers is their use as ordinal adjectives, in phrases such as 'the first', 'the second' and so on.
     From: David Bostock (Philosophy of Mathematics [2009], 9.5.iii)
     A reaction: That is because ordinals seem to attach to particulars, whereas cardinals seem to attach to groups. Then you say 'three is greater than four', it is not clear which type you are talking about.
6. Mathematics / C. Sources of Mathematics / 6. Logicism / b. Type theory
Simple type theory has 'levels', but ramified type theory has 'orders' [Bostock]
     Full Idea: The simple theory of types distinguishes sets into different 'levels', but this is quite different from the distinction into 'orders' which is imposed by the ramified theory.
     From: David Bostock (Philosophy of Mathematics [2009], 8.1)
     A reaction: The ramified theory has both levels and orders (p.235). Russell's terminology is, apparently, inconsistent.
6. Mathematics / C. Sources of Mathematics / 6. Logicism / c. Neo-logicism
Neo-logicists agree that HP introduces number, but also claim that it suffices for the job [Bostock]
     Full Idea: The neo-logicists take up Frege's claim that Hume's Principle introduces a new concept (of a number), but unlike Frege they go on to claim that it by itself gives a complete account of that concept.
     From: David Bostock (Philosophy of Mathematics [2009], 9.A.2)
     A reaction: So the big difference between Frege and neo-logicists is the Julius Caesar problem.
Neo-logicists meet the Caesar problem by saying Hume's Principle is unique to number [Bostock]
     Full Idea: The response of neo-logicists to the Julius Caesar problem is to strengthen Hume's Principle in the hope of ensuring that only numbers will satisfy it. They say the criterion of identity provided by HP is essential to number, and not to anything else.
     From: David Bostock (Philosophy of Mathematics [2009], 9.A.2)
6. Mathematics / C. Sources of Mathematics / 6. Logicism / d. Logicism critique
If Hume's Principle is the whole story, that implies structuralism [Bostock]
     Full Idea: If Hume's Principle is all we are given, by way of explanation of what the numbers are, the only conclusion to draw would seem to be the structuralists' conclusion, ...studying all systems that satisfy that principle.
     From: David Bostock (Philosophy of Mathematics [2009], 9.A.2)
     A reaction: Any approach that implies a set of matching interpretations will always imply structuralism. To avoid it, you need to pin the target down uniquely.
Many crucial logicist definitions are in fact impredicative [Bostock]
     Full Idea: Many of the crucial definitions in the logicist programme are in fact impredicative.
     From: David Bostock (Philosophy of Mathematics [2009], 8.2)
Treating numbers as objects doesn't seem like logic, since arithmetic fixes their totality [Bostock]
     Full Idea: If logic is neutral on the number of objects there are, then logicists can't construe numbers as objects, for arithmetic is certainly not neutral on the number of numbers there are. They must be treated in some other way, perhaps as numerical quantifiers.
     From: David Bostock (Philosophy of Mathematics [2009], 5.5)
6. Mathematics / C. Sources of Mathematics / 9. Fictional Mathematics
Higher cardinalities in sets are just fairy stories [Bostock]
     Full Idea: In its higher reaches, which posit sets of huge cardinalities, set theory is just a fairy story.
     From: David Bostock (Philosophy of Mathematics [2009], 9.5.iii)
     A reaction: You can't say the higher reaches are fairy stories but the lower reaches aren't, if the higher is directly derived from the lower. The empty set and the singleton are fairy stories too. Bostock says the axiom of infinity triggers the fairy stories.
A fairy tale may give predictions, but only a true theory can give explanations [Bostock]
     Full Idea: A common view is that although a fairy tale may provide very useful predictions, it cannot provide explanations for why things happen as they do. In order to do that a theory must also be true (or, at least, an approximation to the truth).
     From: David Bostock (Philosophy of Mathematics [2009], 9.B.5)
     A reaction: Of course, fictionalism offers an explanation of mathematics as a whole, but not of the details (except as the implications of the initial fictional assumptions).
6. Mathematics / C. Sources of Mathematics / 10. Constructivism / c. Conceptualism
The best version of conceptualism is predicativism [Bostock]
     Full Idea: In my personal opinion, predicativism is the best version of conceptualism that we have yet discovered.
     From: David Bostock (Philosophy of Mathematics [2009], 8.4)
     A reaction: Since conceptualism is a major player in the field, this makes predicativism a very important view. I won't vote Predicativist quite yet, but I'm tempted.
Conceptualism fails to grasp mathematical properties, infinity, and objective truth values [Bostock]
     Full Idea: Three simple objections to conceptualism in mathematics are that we do not ascribe mathematical properties to our ideas, that our ideas are presumably finite, and we don't think mathematics lacks truthvalue before we thought of it.
     From: David Bostock (Philosophy of Mathematics [2009], 8.4)
     A reaction: [compressed; Bostock refers back to his Ch 2] Plus Idea 18134. On the whole I sympathise with conceptualism, so I will not allow myself to be impressed by any of these objections. (So, what's actually wrong with them.....?).
6. Mathematics / C. Sources of Mathematics / 10. Constructivism / d. Predicativism
If abstracta only exist if they are expressible, there can only be denumerably many of them [Bostock]
     Full Idea: If an abstract object exists only when there is some suitable way of expressing it, then there are at most denumerably many abstract objects.
     From: David Bostock (Philosophy of Mathematics [2009], 8.2)
     A reaction: Fine by me. What an odd view, to think there are uncountably many abstract objects in existence, only a countable portion of which will ever be expressed! [ah! most people agree with me, p.243-4]
Predicativism makes theories of huge cardinals impossible [Bostock]
     Full Idea: Classical mathematicians say predicative mathematics omits areas of great interest, all concerning non-denumerable real numbers, such as claims about huge cardinals. There cannot be a predicative version of this theory.
     From: David Bostock (Philosophy of Mathematics [2009], 8.3)
     A reaction: I'm not sure that anyone will really miss huge cardinals if they are prohibited, though cryptography seems to flirt with such things. Are we ever allowed to say that some entity conjured up by mathematicians is actually impossible?
If mathematics rests on science, predicativism may be the best approach [Bostock]
     Full Idea: It has been claimed that only predicative mathematics has a justification through its usefulness to science (an empiricist approach).
     From: David Bostock (Philosophy of Mathematics [2009], 8.3)
     A reaction: [compressed. Quine is the obvious candidate] I suppose predicativism gives your theory roots, whereas impredicativism is playing an abstract game.
If we can only think of what we can describe, predicativism may be implied [Bostock]
     Full Idea: If we accept the initial idea that we can think only of what we ourselves can describe, then something like the theory of predicativism quite naturally results
     From: David Bostock (Philosophy of Mathematics [2009], 8.3)
     A reaction: I hate the idea that we can only talk of what falls under a sortal, but 'what we can describe' is much more plausible. Whether or not you agree with this approach (I'm pondering it), this makes predicativism important.
The usual definitions of identity and of natural numbers are impredicative [Bostock]
     Full Idea: The predicative approach cannot accept either the usual definition of identity or the usual definition of the natural numbers, for both of these definitions are impredicative.
     From: David Bostock (Philosophy of Mathematics [2009], 8.3)
     A reaction: [Bostock 237-8 gives details]
The predicativity restriction makes a difference with the real numbers [Bostock]
     Full Idea: It is with the real numbers that the restrictions imposed by predicativity begin to make a real difference.
     From: David Bostock (Philosophy of Mathematics [2009], 8.3)
9. Objects / A. Existence of Objects / 2. Abstract Objects / a. Nature of abstracta
Real numbers as abstracted objects are now treated as complete ordered fields [Mayberry]
     Full Idea: The abstractness of the old fashioned real numbers has been replaced by generality in the modern theory of complete ordered fields.
     From: John Mayberry (What Required for Foundation for Maths? [1994], p.408-2)
     A reaction: In philosophy, I'm increasingly thinking that we should talk much more of 'generality', and a great deal less about 'universals'. (By which I don't mean that redness is just the set of red things).
19. Language / F. Communication / 2. Assertion
In logic a proposition means the same when it is and when it is not asserted [Bostock]
     Full Idea: In Modus Ponens where the first premise is 'P' and the second 'P→Q', in the first premise P is asserted but in the second it is not. Yet it must mean the same in both premises, or it would be guilty of the fallacy of equivocation.
     From: David Bostock (Philosophy of Mathematics [2009], 7.2)
     A reaction: This is Geach's thought (leading to an objection to expressivism in ethics, that P means the same even if it is not expressed).
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').