79 ideas
| 9641 | Definitions should be replaceable by primitives, and should not be creative [Brown,JR] |
| Full Idea: The standard requirement of definitions involves 'eliminability' (any defined terms must be replaceable by primitives) and 'non-creativity' (proofs of theorems should not depend on the definition). | |
| From: James Robert Brown (Philosophy of Mathematics [1999], Ch. 7) | |
| A reaction: [He cites Russell and Whitehead as a source for this view] This is the austere view of the mathematician or logician. But almost every abstract concept that we use was actually defined in a creative way. |
| 9634 | Set theory says that natural numbers are an actual infinity (to accommodate their powerset) [Brown,JR] |
| Full Idea: The set-theory account of infinity doesn't just say that we can keep on counting, but that the natural numbers are an actual infinite set. This is necessary to make sense of the powerset of ω, as the set of all its subsets, and thus even bigger. | |
| From: James Robert Brown (Philosophy of Mathematics [1999], Ch. 5) | |
| A reaction: I don't personally find this to be sufficient reason to commit myself to the existence of actual infinities. In fact I have growing doubts about the whole role of set theory in philosophy of mathematics. Shows how much I know. |
| 10073 | There cannot be a set theory which is complete [Smith,P] |
| Full Idea: By Gödel's First Incompleteness Theorem, there cannot be a negation-complete set theory. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 01.3) | |
| A reaction: This means that we can never prove all the truths of a system of set theory. |
| 9613 | Naďve set theory assumed that there is a set for every condition [Brown,JR] |
| Full Idea: In the early versions of set theory ('naďve' set theory), the axiom of comprehension assumed that for any condition there is a set of objects satisfying that condition (so P(x)↔x∈{x:P(x)}), but this led directly to Russell's Paradox. | |
| From: James Robert Brown (Philosophy of Mathematics [1999], Ch. 2) | |
| A reaction: How rarely any philosophers state this problem clearly (as Brown does here). This is incredibly important for our understanding of how we classify the world. I'm tempted to just ignore Russell, and treat sets in a natural and sensible way. |
| 9615 | Nowadays conditions are only defined on existing sets [Brown,JR] |
| Full Idea: In current set theory Russell's Paradox is avoided by saying that a condition can only be defined on already existing sets. | |
| From: James Robert Brown (Philosophy of Mathematics [1999], Ch. 2) | |
| A reaction: A response to Idea 9613. This leaves us with no account of how sets are created, so we have the modern notion that absolutely any grouping of daft things is a perfectly good set. The logicians seem to have hijacked common sense. |
| 9617 | The 'iterative' view says sets start with the empty set and build up [Brown,JR] |
| Full Idea: The modern 'iterative' concept of a set starts with the empty set φ (or unsetted individuals), then uses set-forming operations (characterized by the axioms) to build up ever more complex sets. | |
| From: James Robert Brown (Philosophy of Mathematics [1999], Ch. 2) | |
| A reaction: The only sets in our system will be those we can construct, rather than anything accepted intuitively. It is more about building an elaborate machine that works than about giving a good model of reality. |
| 9642 | A flock of birds is not a set, because a set cannot go anywhere [Brown,JR] |
| Full Idea: Neither a flock of birds nor a pack of wolves is strictly a set, since a flock can fly south, and a pack can be on the prowl, whereas sets go nowhere and menace no one. | |
| From: James Robert Brown (Philosophy of Mathematics [1999], Ch. 7) | |
| A reaction: To say that the pack menaced you would presumably be to commit the fallacy of composition. Doesn't the number 64 have properties which its set-theoretic elements (whatever we decide they are) will lack? |
| 10616 | Second-order arithmetic can prove new sentences of first-order [Smith,P] |
| Full Idea: Going second-order in arithmetic enables us to prove new first-order arithmetical sentences that we couldn't prove before. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 23.4) | |
| A reaction: The wages of Satan, perhaps. We can prove things about objects by proving things about their properties and sets and functions. Smith says this fact goes all the way up the hierarchy. |
| 9605 | If a proposition is false, then its negation is true [Brown,JR] |
| Full Idea: The law of excluded middle says if a proposition is false, then its negation is true | |
| From: James Robert Brown (Philosophy of Mathematics [1999], Ch. 1) | |
| A reaction: Surely that is the best statement of the law? How do you write that down? ¬(P)→¬P? No, because it is a semantic claim, not a syntactic claim, so a truth table captures it. Semantic claims are bigger than syntactic claims. |
| 10076 | The 'range' of a function is the set of elements in the output set created by the function [Smith,P] |
| Full Idea: The 'range' of a function is the set of elements in the output set that are values of the function for elements in the original set. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 02.1) | |
| A reaction: In other words, the range is the set of values that were created by the function. |
| 10605 | Two functions are the same if they have the same extension [Smith,P] |
| Full Idea: We count two functions as being the same if they have the same extension, i.e. if they pair up arguments with values in the same way. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 11.3) | |
| A reaction: So there's only one way to skin a cat in mathematical logic. |
| 10075 | A 'partial function' maps only some elements to another set [Smith,P] |
| Full Idea: A 'partial function' is one which maps only some elements of a domain to elements in another set. For example, the reciprocal function 1/x is not defined for x=0. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 02.1 n1) |
| 10074 | A 'total function' maps every element to one element in another set [Smith,P] |
| Full Idea: A 'total function' is one which maps every element of a domain to exactly one corresponding value in another set. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 02.1) |
| 10612 | An argument is a 'fixed point' for a function if it is mapped back to itself [Smith,P] |
| Full Idea: If a function f maps the argument a back to a itself, so that f(a) = a, then a is said to be a 'fixed point' for f. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 20.5) |
| 10615 | The Comprehension Schema says there is a property only had by things satisfying a condition [Smith,P] |
| Full Idea: The so-called Comprehension Schema ∃X∀x(Xx ↔ φ(x)) says that there is a property which is had by just those things which satisfy the condition φ. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 22.3) |
| 10595 | A 'theorem' of a theory is a sentence derived from the axioms using the proof system [Smith,P] |
| Full Idea: 'Theorem': given a derivation of the sentence φ from the axioms of the theory T using the background logical proof system, we will say that φ is a 'theorem' of the theory. Standard abbreviation is T |- φ. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 03.4) |
| 10602 | A 'natural deduction system' has no axioms but many rules [Smith,P] |
| Full Idea: A 'natural deduction system' will have no logical axioms but may rules of inference. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 09.1) | |
| A reaction: He contrasts this with 'Hilbert-style systems', which have many axioms but few rules. Natural deduction uses many assumptions which are then discharged, and so tree-systems are good for representing it. |
| 10613 | No nice theory can define truth for its own language [Smith,P] |
| Full Idea: No nice theory can define truth for its own language. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 21.5) | |
| A reaction: This leads on to Tarski's account of truth. |
| 10078 | An 'injective' ('one-to-one') function creates a distinct output element from each original [Smith,P] |
| Full Idea: An 'injective' function is 'one-to-one' - each element of the output set results from a different element of the original set. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 02.1) | |
| A reaction: That is, two different original elements cannot lead to the same output element. |
| 10079 | A 'bijective' function has one-to-one correspondence in both directions [Smith,P] |
| Full Idea: A 'bijective' function has 'one-to-one correspondence' - it is both surjective and injective, so that every element in each of the original and the output sets has a matching element in the other. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 02.1) | |
| A reaction: Note that 'injective' is also one-to-one, but only in the one direction. |
| 10077 | A 'surjective' ('onto') function creates every element of the output set [Smith,P] |
| Full Idea: A 'surjective' function is 'onto' - the whole of the output set results from the function being applied to elements of the original set. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 02.1) |
| 9649 | Axioms are either self-evident, or stipulations, or fallible attempts [Brown,JR] |
| Full Idea: The three views one could adopt concerning axioms are that they are self-evident truths, or that they are arbitrary stipulations, or that they are fallible attempts to describe how things are. | |
| From: James Robert Brown (Philosophy of Mathematics [1999], Ch.10) | |
| A reaction: Presumably modern platonists like the third version, with others choosing the second, and hardly anyone now having the confidence to embrace the first. |
| 10070 | If everything that a theory proves is true, then it is 'sound' [Smith,P] |
| Full Idea: If everything that a theory proves must be true, then it is a 'sound' theory. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 01.1) |
| 10086 | Soundness is true axioms and a truth-preserving proof system [Smith,P] |
| Full Idea: Soundness is normally a matter of having true axioms and a truth-preserving proof system. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 03.4) | |
| A reaction: The only exception I can think of is if a theory consisted of nothing but the axioms. |
| 10596 | A theory is 'sound' iff every theorem is true (usually from true axioms and truth-preservation) [Smith,P] |
| Full Idea: A theory is 'sound' iff every theorem of it is true (i.e. true on the interpretation built into its language). Soundness is normally a matter of having true axioms and a truth-preserving proof system. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 03.4) |
| 10598 | A theory is 'negation complete' if it proves all sentences or their negation [Smith,P] |
| Full Idea: A theory is 'negation complete' if it decides every sentence of its language (either the sentence, or its negation). | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 03.4) |
| 10597 | 'Complete' applies both to whole logics, and to theories within them [Smith,P] |
| Full Idea: There is an annoying double-use of 'complete': a logic may be semantically complete, but there may be an incomplete theory expressed in it. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 03.4) |
| 10069 | A theory is 'negation complete' if one of its sentences or its negation can always be proved [Smith,P] |
| Full Idea: Logicians say that a theory T is '(negation) complete' if, for every sentence φ in the language of the theory, either φ or ¬φ is deducible in T's proof system. If this were the case, then truth could be equated with provability. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 01.1) | |
| A reaction: The word 'negation' seems to be a recent addition to the concept. Presumable it might be the case that φ can always be proved, but not ¬φ. |
| 10609 | Two routes to Incompleteness: semantics of sound/expressible, or syntax of consistency/proof [Smith,P] |
| Full Idea: There are two routes to Incompleteness results. One goes via the semantic assumption that we are dealing with sound theories, using a result about what they can express. The other uses the syntactic notion of consistency, with stronger notions of proof. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 18.1) |
| 10080 | 'Effective' means simple, unintuitive, independent, controlled, dumb, and terminating [Smith,P] |
| Full Idea: An 'effectively decidable' (or 'computable') algorithm will be step-by-small-step, with no need for intuition, or for independent sources, with no random methods, possible for a dumb computer, and terminates in finite steps. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 02.2) | |
| A reaction: [a compressed paragraph] |
| 10087 | A theory is 'decidable' if all of its sentences could be mechanically proved [Smith,P] |
| Full Idea: A theory is 'decidable' iff there is a mechanical procedure for determining whether any sentence of its language can be proved. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 03.4) | |
| A reaction: Note that it doesn't actually have to be proved. The theorems of the theory are all effectively decidable. |
| 10088 | Any consistent, axiomatized, negation-complete formal theory is decidable [Smith,P] |
| Full Idea: Any consistent, axiomatized, negation-complete formal theory is decidable. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 03.6) |
| 10081 | A set is 'enumerable' is all of its elements can result from a natural number function [Smith,P] |
| Full Idea: A set is 'enumerable' iff either the set is empty, or there is a surjective function to the set from the set of natural numbers, so that the set is in the range of that function. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 02.3) |
| 10083 | A set is 'effectively enumerable' if a computer could eventually list every member [Smith,P] |
| Full Idea: A set is 'effectively enumerable' if an (idealised) computer could be programmed to generate a list of its members such that any member will eventually be mentioned (even if the list is empty, or without end, or contains repetitions). | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 02.4) |
| 10084 | A finite set of finitely specifiable objects is always effectively enumerable (e.g. primes) [Smith,P] |
| Full Idea: A finite set of finitely specifiable objects is always effectively enumerable (for example, the prime numbers). | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 02.4) |
| 10085 | The set of ordered pairs of natural numbers <i,j> is effectively enumerable [Smith,P] |
| Full Idea: The set of ordered pairs of natural numbers (i,j) is effectively enumerable, as proven by listing them in an array (across: <0,0>, <0,1>, <0,2> ..., and down: <0,0>, <1,0>, <2,0>...), and then zig-zagging. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 02.5) |
| 10601 | The thorems of a nice arithmetic can be enumerated, but not the truths (so they're diffferent) [Smith,P] |
| Full Idea: The theorems of any properly axiomatized theory can be effectively enumerated. However, the truths of any sufficiently expressive arithmetic can't be effectively enumerated. Hence the theorems and truths of arithmetic cannot be the same. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 05 Intro) |
| 10600 | Being 'expressible' depends on language; being 'capture/represented' depends on axioms and proof system [Smith,P] |
| Full Idea: Whether a property is 'expressible' in a given theory depends on the richness of the theory's language. Whether the property can be 'captured' (or 'represented') by the theory depends on the richness of the axioms and proof system. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 04.7) |
| 9638 | Berry's Paradox finds a contradiction in the naming of huge numbers [Brown,JR] |
| Full Idea: Berry's Paradox refers to 'the least integer not namable in fewer than nineteen syllables' - a paradox because it has just been named in eighteen syllables. | |
| From: James Robert Brown (Philosophy of Mathematics [1999], Ch. 5) | |
| A reaction: Apparently George Boolos used this quirky idea as a basis for a new and more streamlined proof of Gödel's Theorem. Don't tell me you don't find that impressive. |
| 9604 | Mathematics is the only place where we are sure we are right [Brown,JR] |
| Full Idea: Mathematics seems to be the one and only place where we humans can be absolutely sure that we got it right. | |
| From: James Robert Brown (Philosophy of Mathematics [1999], Ch. 1) | |
| A reaction: Apart from death and taxes, that is. Personally I am more certain of the keyboard I am typing on than I am of Pythagoras's Theorem, but the experts seem pretty confident about the number stuff. |
| 10599 | For primes we write (x not= 1 ∧ ∀u∀v(u x v = x → (u = 1 ∨ v = 1))) [Smith,P] |
| Full Idea: For prime numbers we write (x not= 1 ∧ ∀u∀v(u x v = x → (u = 1 ∨ v = 1))). That is, the only way to multiply two numbers and a get a prime is if one of them is 1. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 04.5) |
| 9622 | 'There are two apples' can be expressed logically, with no mention of numbers [Brown,JR] |
| Full Idea: 'There are two apples' can be recast as 'x is an apple and y is an apple, and x isn't y, and if z is an apple it is the same as x or y', which makes no appeal at all to mathematics. | |
| From: James Robert Brown (Philosophy of Mathematics [1999], Ch. 4) | |
| A reaction: He cites this as the basis of Hartry Field's claim that science can be done without numbers. The logic is ∃x∃y∀z(Ax&Ay&(x¬=y)&(Az→z=x∨z=y)). |
| 10610 | The reals contain the naturals, but the theory of reals doesn't contain the theory of naturals [Smith,P] |
| Full Idea: It has been proved (by Tarski) that the real numbers R is a complete theory. But this means that while the real numbers contain the natural numbers, the pure theory of real numbers doesn't contain the theory of natural numbers. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 18.2) |
| 9648 | π is a 'transcendental' number, because it is not the solution of an equation [Brown,JR] |
| Full Idea: The number π is not only irrational, but it is also (unlike √2) a 'transcendental' number, because it is not the solution of an algebraic equation. | |
| From: James Robert Brown (Philosophy of Mathematics [1999], Ch.10) | |
| A reaction: So is that a superficial property, or a profound one? Answers on a post card. |
| 10619 | The truths of arithmetic are just true equations and their universally quantified versions [Smith,P] |
| Full Idea: The truths of arithmetic are just the true equations involving particular numbers, and universally quantified versions of such equations. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 27.7) | |
| A reaction: Must each equation be universally quantified? Why can't we just universally quantify over the whole system? |
| 9621 | Mathematics represents the world through structurally similar models. [Brown,JR] |
| Full Idea: Mathematics hooks onto the world by providing representations in the form of structurally similar models. | |
| From: James Robert Brown (Philosophy of Mathematics [1999], Ch. 4) | |
| A reaction: This is Brown's conclusion. It needs notions of mapping, one-to-one correspondence, and similarity. I like the idea of a 'model', as used in both logic and mathematics, and children's hobbies. The mind is a model-making machine. |
| 9646 | There is no limit to how many ways something can be proved in mathematics [Brown,JR] |
| Full Idea: I'm tempted to say that mathematics is so rich that there are indefinitely many ways to prove anything - verbal/symbolic derivations and pictures are just two. | |
| From: James Robert Brown (Philosophy of Mathematics [1999], Ch. 9) | |
| A reaction: Brown has been defending pictures as a form of proof. I wonder how long his list would be, if we challenged him to give more details? Some people have very low standards of proof. |
| 9647 | Computers played an essential role in proving the four-colour theorem of maps [Brown,JR] |
| Full Idea: The celebrity of the famous proof in 1976 of the four-colour theorem of maps is that a computer played an essential role in the proof. | |
| From: James Robert Brown (Philosophy of Mathematics [1999], Ch.10) | |
| A reaction: The problem concerns the reliability of the computers, but then all the people who check a traditional proof might also be unreliable. Quis custodet custodies? |
| 10618 | All numbers are related to zero by the ancestral of the successor relation [Smith,P] |
| Full Idea: All numbers are related to zero by the ancestral of the successor relation. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 23.5) | |
| A reaction: The successor relation only ties a number to the previous one, not to the whole series. Ancestrals are a higher level of abstraction. |
| 10608 | The number of Fs is the 'successor' of the Gs if there is a single F that isn't G [Smith,P] |
| Full Idea: The number of Fs is the 'successor' of the number of Gs if there is an object which is an F, and the remaining things that are F but not identical to the object are equinumerous with the Gs. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 14.1) |
| 10849 | Baby arithmetic covers addition and multiplication, but no general facts about numbers [Smith,P] |
| Full Idea: Baby Arithmetic 'knows' the addition of particular numbers and multiplication, but can't express general facts about numbers, because it lacks quantification. It has a constant '0', a function 'S', and functions '+' and 'x', and identity and negation. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 08.1) |
| 10850 | Baby Arithmetic is complete, but not very expressive [Smith,P] |
| Full Idea: Baby Arithmetic is negation complete, so it can prove every claim (or its negation) that it can express, but it is expressively extremely impoverished. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 08.3) |
| 10851 | Robinson Arithmetic 'Q' has basic axioms, quantifiers and first-order logic [Smith,P] |
| Full Idea: We can beef up Baby Arithmetic into Robinson Arithmetic (referred to as 'Q'), by restoring quantifiers and variables. It has seven generalised axioms, plus standard first-order logic. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 08.3) |
| 10852 | Robinson Arithmetic (Q) is not negation complete [Smith,P] |
| Full Idea: Robinson Arithmetic (Q) is not negation complete | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 08.4) |
| 10068 | Natural numbers have zero, unique successors, unending, no circling back, and no strays [Smith,P] |
| Full Idea: The sequence of natural numbers starts from zero, and each number has just one immediate successor; the sequence continues without end, never circling back on itself, and there are no 'stray' numbers, lurking outside the sequence. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 01.1) | |
| A reaction: These are the characteristics of the natural numbers which have to be pinned down by any axiom system, such as Peano's, or any more modern axiomatic structures. We are in the territory of Gödel's theorems. |
| 10603 | The logic of arithmetic must quantify over properties of numbers to handle induction [Smith,P] |
| Full Idea: If the logic of arithmetic doesn't have second-order quantifiers to range over properties of numbers, how can it handle induction? | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 10.1) |
| 10848 | Multiplication only generates incompleteness if combined with addition and successor [Smith,P] |
| Full Idea: Multiplication in itself isn't is intractable. In 1929 Skolem showed a complete theory for a first-order language with multiplication but lacking addition (or successor). Multiplication together with addition and successor produces incompleteness. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 10.7 n8) |
| 10604 | Incompleteness results in arithmetic from combining addition and successor with multiplication [Smith,P] |
| Full Idea: Putting multiplication together with addition and successor in the language of arithmetic produces incompleteness. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 10.7) | |
| A reaction: His 'Baby Arithmetic' has all three and is complete, but lacks quantification (p.51) |
| 9643 | Set theory may represent all of mathematics, without actually being mathematics [Brown,JR] |
| Full Idea: Maybe all of mathematics can be represented in set theory, but we should not think that mathematics is set theory. Functions can be represented as order pairs, but perhaps that is not what functions really are. | |
| From: James Robert Brown (Philosophy of Mathematics [1999], Ch. 7) | |
| A reaction: This seems to me to be the correct view of the situation. If 2 is represented as {φ,{φ}}, why is that asymmetrical? The first digit seems to be the senior and original partner, but how could the digits of 2 differ from one another? |
| 9644 | When graphs are defined set-theoretically, that won't cover unlabelled graphs [Brown,JR] |
| Full Idea: The basic definition of a graph can be given in set-theoretic terms,...but then what could an unlabelled graph be? | |
| From: James Robert Brown (Philosophy of Mathematics [1999], Ch. 7) | |
| A reaction: An unlabelled graph will at least need a verbal description for it to have any significance at all. My daily mood-swings look like this.... |
| 9625 | To see a structure in something, we must already have the idea of the structure [Brown,JR] |
| Full Idea: Epistemology is a big worry for structuralists. ..To conjecture that something has a particular structure, we must already have conceived of the idea of the structure itself; we cannot be discovering structures by conjecturing them. | |
| From: James Robert Brown (Philosophy of Mathematics [1999], Ch. 4) | |
| A reaction: This has to be a crucial area of discussion. Do we have our heads full of abstract structures before we look out of the window? Externalism about the mind is important here; mind and world are not utterly distinct things. |
| 9628 | Sets seem basic to mathematics, but they don't suit structuralism [Brown,JR] |
| Full Idea: Set theory is at the very heart of mathematics; it may even be all there is to mathematics. The notion of set, however, seems quite contrary to the spirit of structuralism. | |
| From: James Robert Brown (Philosophy of Mathematics [1999], Ch. 4) | |
| A reaction: So much the worse for sets, I say. You can, for example, define ordinality in terms of sets, but that is no good if ordinality is basic to the nature of numbers, rather than a later addition. |
| 9606 | The irrationality of root-2 was achieved by intellect, not experience [Brown,JR] |
| Full Idea: We could not discover irrational numbers by physical measurement. The discovery of the irrationality of the square root of two was an intellectual achievement, not at all connected to sense experience. | |
| From: James Robert Brown (Philosophy of Mathematics [1999], Ch. 1) | |
| A reaction: Brown declares himself a platonist, and this is clearly a key argument for him, and rather a good one. Hm. I'll get back to you on this one... |
| 9612 | There is an infinity of mathematical objects, so they can't be physical [Brown,JR] |
| Full Idea: A simple argument makes it clear that all mathematical arguments are abstract: there are infinitely many numbers, but only a finite number of physical entities, so most mathematical objects are non-physical. The best assumption is that they all are. | |
| From: James Robert Brown (Philosophy of Mathematics [1999], Ch. 2) | |
| A reaction: This, it seems to me, is where constructivists score well (cf. Idea 9608). I don't have an infinity of bricks to build an infinity of houses, but I can imagine that the bricks just keep coming if I need them. Imagination is what is unbounded. |
| 9610 | Numbers are not abstracted from particulars, because each number is a particular [Brown,JR] |
| Full Idea: Numbers are not 'abstract' (in the old sense, of universals abstracted from particulars), since each of the integers is a unique individual, a particular, not a universal. | |
| From: James Robert Brown (Philosophy of Mathematics [1999], Ch. 2) | |
| A reaction: An interesting observation which I have not seen directly stated before. Compare Idea 645. I suspect that numbers should be thought of as higher-order abstractions, which don't behave like normal universals (i.e. they're not distributed). |
| 9620 | Empiricists base numbers on objects, Platonists base them on properties [Brown,JR] |
| Full Idea: Perhaps, instead of objects, numbers are associated with properties of objects. Basing them on objects is strongly empiricist and uses first-order logic, whereas the latter view is somewhat Platonistic, and uses second-order logic. | |
| From: James Robert Brown (Philosophy of Mathematics [1999], Ch. 4) | |
| A reaction: I don't seem to have a view on this. You can count tomatoes, or you can count red objects, or even 'instances of red'. Numbers refer to whatever can be individuated. No individuation, no arithmetic. (It's also Hume v Armstrong on laws on nature). |
| 9639 | Does some mathematics depend entirely on notation? [Brown,JR] |
| Full Idea: Are there mathematical properties which can only be discovered using a particular notation? | |
| From: James Robert Brown (Philosophy of Mathematics [1999], Ch. 6) | |
| A reaction: If so, this would seem to be a serious difficulty for platonists. Brown has just been exploring the mathematical theory of knots. |
| 9629 | For nomalists there are no numbers, only numerals [Brown,JR] |
| Full Idea: For the instinctive nominalist in mathematics, there are no numbers, only numerals. | |
| From: James Robert Brown (Philosophy of Mathematics [1999], Ch. 5) | |
| A reaction: Maybe. A numeral is a specific sign, sometimes in a specific natural language, so this seems to miss the fact that cardinality etc are features of reality, not just conventions. |
| 9630 | The most brilliant formalist was Hilbert [Brown,JR] |
| Full Idea: In mathematics, the most brilliant formalist of all was Hilbert | |
| From: James Robert Brown (Philosophy of Mathematics [1999], Ch. 5) | |
| A reaction: He seems to have developed his fully formalist views later in his career. See Mathematics|Basis of Mathematic|Formalism in our thematic section. Kreisel denies that Hilbert was a true formalist. |
| 9608 | There are no constructions for many highly desirable results in mathematics [Brown,JR] |
| Full Idea: Constuctivists link truth with constructive proof, but necessarily lack constructions for many highly desirable results of classical mathematics, making their account of mathematical truth rather implausible. | |
| From: James Robert Brown (Philosophy of Mathematics [1999], Ch. 2) | |
| A reaction: The tricky word here is 'desirable', which is an odd criterion for mathematical truth. Nevertheless this sounds like a good objection. How flexible might the concept of a 'construction' be? |
| 9645 | Constructivists say p has no value, if the value depends on Goldbach's Conjecture [Brown,JR] |
| Full Idea: If we define p as '3 if Goldbach's Conjecture is true' and '5 if Goldbach's Conjecture is false', it seems that p must be a prime number, but, amazingly, constructivists would not accept this without a proof of Goldbach's Conjecture. | |
| From: James Robert Brown (Philosophy of Mathematics [1999], Ch. 8) | |
| A reaction: A very similar argument structure to Schrödinger's Cat. This seems (as Brown implies) to be a devastating knock-down argument, but I'll keep an open mind for now. |
| 9619 | David's 'Napoleon' is about something concrete and something abstract [Brown,JR] |
| Full Idea: David's painting of Napoleon (on a white horse) is a 'picture' of Napoleon, and a 'symbol' of leadership, courage, adventure. It manages to be about something concrete and something abstract. | |
| From: James Robert Brown (Philosophy of Mathematics [1999], Ch. 3) | |
| A reaction: This strikes me as the germ of an extremely important idea - that abstraction is involved in our perception of the concrete, so that they are not two entirely separate realms. Seeing 'as' involves abstraction. |
| 10617 | The 'ancestral' of a relation is a new relation which creates a long chain of the original relation [Smith,P] |
| Full Idea: The 'ancestral' of a relation is that relation which holds when there is an indefinitely long chain of things having the initial relation. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 23.5) | |
| A reaction: The standard example is spotting the relation 'ancestor' from the receding relation 'parent'. This is a sort of abstraction derived from a relation which is not equivalent (parenthood being transitive but not reflexive). The idea originated with Frege. |
| 9611 | 'Abstract' nowadays means outside space and time, not concrete, not physical [Brown,JR] |
| Full Idea: The current usage of 'abstract' simply means outside space and time, not concrete, not physical. | |
| From: James Robert Brown (Philosophy of Mathematics [1999], Ch. 2) | |
| A reaction: This is in contrast to Idea 9609 (the older notion of being abstracted). It seems odd that our ancestors had a theory about where such ideas came from, but modern thinkers have no theory at all. Blame Frege for that. |
| 9609 | The older sense of 'abstract' is where 'redness' or 'group' is abstracted from particulars [Brown,JR] |
| Full Idea: The older sense of 'abstract' applies to universals, where a universal like 'redness' is abstracted from red particulars; it is the one associated with the many. In mathematics, the notion of 'group' or 'vector space' perhaps fits this pattern. | |
| From: James Robert Brown (Philosophy of Mathematics [1999], Ch. 2) | |
| A reaction: I am currently investigating whether this 'older' concept is in fact dead. It seems to me that it is needed, as part of cognitive science, and as the crucial link between a materialist metaphysic and the world of ideas. |
| 9640 | A term can have not only a sense and a reference, but also a 'computational role' [Brown,JR] |
| Full Idea: In addition to the sense and reference of term, there is the 'computational' role. The name '2' has a sense (successor of 1) and a reference (the number 2). But the word 'two' has little computational power, Roman 'II' is better, and '2' is a marvel. | |
| From: James Robert Brown (Philosophy of Mathematics [1999], Ch. 6) | |
| A reaction: Very interesting, and the point might transfer to natural languages. Synonymous terms carry with them not just different expressive powers, but the capacity to play different roles (e.g. slang and formal terms, gob and mouth). |
| 13304 | Learned men gain more in one day than others do in a lifetime [Posidonius] |
| Full Idea: In a single day there lies open to men of learning more than there ever does to the unenlightened in the longest of lifetimes. | |
| From: Posidonius (fragments/reports [c.95 BCE]), quoted by Seneca the Younger - Letters from a Stoic 078 | |
| A reaction: These remarks endorsing the infinite superiority of the educated to the uneducated seem to have been popular in late antiquity. It tends to be the religions which discourage great learning, especially in their emphasis on a single book. |
| 9635 | Given atomism at one end, and a finite universe at the other, there are no physical infinities [Brown,JR] |
| Full Idea: There seem to be no actual infinites in the physical realm. Given the correctness of atomism, there are no infinitely small things, no infinite divisibility. And General Relativity says that the universe is only finitely large. | |
| From: James Robert Brown (Philosophy of Mathematics [1999], Ch. 5) | |
| A reaction: If time was infinite, you could travel round in a circle forever. An atom has size, so it has a left, middle and right to it. Etc. They seem to be physical, so we will count those too. |
| 20820 | Time is an interval of motion, or the measure of speed [Posidonius, by Stobaeus] |
| Full Idea: Posidonius defined time thus: it is an interval of motion, or the measure of speed and slowness. | |
| From: report of Posidonius (fragments/reports [c.95 BCE]) by John Stobaeus - Anthology 1.08.42 | |
| A reaction: Hm. Can we define motion or speed without alluding to time? Looks like we have to define them as a conjoined pair, which means we cannot fully understand either of them. |