85 ideas
| 13860 | We can only learn from philosophers of the past if we accept the risk of major misrepresentation [Wright,C] |
| Full Idea: We can learn from the work of philosophers of other periods only if we are prepared to run the risk of radical and almost inevitable misrepresentation of his thought. | |
| From: Crispin Wright (Frege's Concept of Numbers as Objects [1983], Pref) | |
| A reaction: This sounds about right, and a motto for my own approach to Aristotle and Leibniz, but I see the effort as more collaborative than this suggests. Professional specialists in older philosophers are a vital part of the team. Read them! |
| 13883 | The best way to understand a philosophical idea is to defend it [Wright,C] |
| Full Idea: The most productive way in which to attempt an understanding of any philosophical idea is to work on its defence. | |
| From: Crispin Wright (Frege's Concept of Numbers as Objects [1983], 1.vii) | |
| A reaction: Very nice. The key point is that this brings greater understanding than working on attacking an idea, which presumably has the dangers of caricature, straw men etc. It is the Socratic insight that dialectic is the route to wisdom. |
| 10142 | The attempt to define numbers by contextual definition has been revived [Wright,C, by Fine,K] |
| Full Idea: Frege gave up on the attempt to introduce natural numbers by contextual definition, but the project has been revived by neo-logicists. | |
| From: report of Crispin Wright (Frege's Concept of Numbers as Objects [1983]) by Kit Fine - The Limits of Abstraction II |
| 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. |
| 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. |
| 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) |
| 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) |
| 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) |
| 17744 | De Morgan started the study of relations and their properties [De Morgan, by Walicki] |
| Full Idea: De Morgan started the sustained interest in the study of relations and their properties. | |
| From: report of Augustus De Morgan (On the Syllogism IV [1859]) by Michal Walicki - Introduction to Mathematical Logic History D.1.1 |
| 13501 | De Morgan found inferences involving relations, which eluded Aristotle's syllogistic [De Morgan, by Hart,WD] |
| Full Idea: There was a prejudice against relations (in favour of properties) but De Morgan and others that impeccable inferences turn on relations and elude Aristotle's syllogistic. Thus: All horses are animals. Hence, all heads of horses are heads of animals. | |
| From: report of Augustus De Morgan (On the Syllogism IV [1859]) by William D. Hart - The Evolution of Logic 4 | |
| A reaction: This is actually an early example of modern analytic philosophy in action. You start with the inferences, and then work back to the ontology and the definition of concepts. But in pinning down such concepts, do we miss their full meaning? |
| 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) |
| 9868 | An expression refers if it is a singular term in some true sentences [Wright,C, by Dummett] |
| Full Idea: For Wright, an expression refers to an object if it fulfils the 'syntactic role' of a singular term, and if we have fixed the truth-conditions of sentences containing it in such a way that some of them come out true. | |
| From: report of Crispin Wright (Frege's Concept of Numbers as Objects [1983]) by Michael Dummett - Frege philosophy of mathematics Ch.15 | |
| A reaction: Much waffle is written about reference, and it is nice to hear of someone actually trying to state the necessary and sufficient conditions for reference to be successful. So is it possible for 'the round square' to ever refer? '...is impossible to draw' |
| 17743 | De Morgan introduced a 'universe of discourse', to replace Boole's universe of 'all things' [De Morgan, by Walicki] |
| Full Idea: In 1846 De Morgan introduced the enormously influential notion of a possibly arbitrary and stipulated 'universe of discourse'. It replaced Boole's original - and metaphysically a bit suspect - universe of 'all things'. | |
| From: report of Augustus De Morgan (works [1846]) by Michal Walicki - Introduction to Mathematical Logic History D.1.1 | |
| A reaction: This not only brings formal logic under control, but also reflects normal talk, because there is always an explicit or implicit domain of discourse when we talk. Of virtually any conversation, you can say what it is 'about'. |
| 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. |
| 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) |
| 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. |
| 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) |
| 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 ¬φ. |
| 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) |
| 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) |
| 13861 | Number theory aims at the essence of natural numbers, giving their nature, and the epistemology [Wright,C] |
| Full Idea: In the Fregean view number theory is a science, aimed at those truths furnished by the essential properties of zero and its successors. The two broad question are then the nature of the objects, and the epistemology of those facts. | |
| From: Crispin Wright (Frege's Concept of Numbers as Objects [1983], Intro) | |
| A reaction: [compressed] I pounce on the word 'essence' here (my thing). My first question is about the extent to which the natural numbers all have one generic essence, and the extent to which they are individuals (bless their little cotton socks). |
| 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) |
| 13892 | One could grasp numbers, and name sizes with them, without grasping ordering [Wright,C] |
| Full Idea: Someone could be clear about number identities, and distinguish numbers from other things, without conceiving them as ordered in a progression at all. The point of them would be to make comparisons between sizes of groups. | |
| From: Crispin Wright (Frege's Concept of Numbers as Objects [1983], 3.xv) | |
| A reaction: Hm. Could you grasp size if you couldn't grasp which of two groups was the bigger? What's the point of noting that I have ten pounds and you only have five, if you don't realise that I have more than you? You could have called them Caesar and Brutus. |
| 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) |
| 13867 | Instances of a non-sortal concept can only be counted relative to a sortal concept [Wright,C] |
| Full Idea: The invitation to number the instances of some non-sortal concept is intelligible only if it is relativised to a sortal. | |
| From: Crispin Wright (Frege's Concept of Numbers as Objects [1983], 1.i) | |
| A reaction: I take this to be an essentially Fregean idea, as when we count the boots when we have decided whether they fall under the concept 'boot' or the concept 'pair'. I also take this to be the traditional question 'what units are you using'? |
| 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? |
| 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) |
| 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) |
| 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) |
| 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. |
| 17441 | Wright thinks Hume's Principle is more fundamental to cardinals than the Peano Axioms are [Wright,C, by Heck] |
| Full Idea: Wright is claiming that HP is a special sort of truth in some way: it is supposed to be the fundamental truth about cardinality; ...in particular, HP is supposed to be more fundamental, in some sense than the Dedekind-Peano axioms. | |
| From: report of Crispin Wright (Frege's Concept of Numbers as Objects [1983]) by Richard G. Heck - Cardinality, Counting and Equinumerosity 1 | |
| A reaction: Heck notes that although PA can be proved from HP, HP can be proven from PA plus definitions, so direction of proof won't show fundamentality. He adds that Wright thinks HP is 'more illuminating'. |
| 13862 | There are five Peano axioms, which can be expressed informally [Wright,C] |
| Full Idea: Informally, Peano's axioms are: 0 is a number, numbers have a successor, different numbers have different successors, 0 isn't a successor, properties of 0 which carry over to successors are properties of all numbers. | |
| From: Crispin Wright (Frege's Concept of Numbers as Objects [1983], Intro) | |
| A reaction: Each statement of the famous axioms is slightly different from the others, and I have reworded Wright to fit him in. Since the last one (the 'induction axiom') is about properties, it invites formalization in second-order logic. |
| 17853 | Number truths are said to be the consequence of PA - but it needs semantic consequence [Wright,C] |
| Full Idea: The intuitive proposal is the essential number theoretic truths are precisely the logical consequences of the Peano axioms, ...but the notion of consequence is a semantic one...and it is not obvious that we possess a semantic notion of the requisite kind. | |
| From: Crispin Wright (Frege's Concept of Numbers as Objects [1983], Intro) | |
| A reaction: (Not sure I understand this, but it is his starting point for rejecting PA as the essence of arithmetic). |
| 17854 | What facts underpin the truths of the Peano axioms? [Wright,C] |
| Full Idea: We incline to think of the Peano axioms as truths of some sort; so there has to be a philosophical question how we ought to conceive of the nature of the facts which make those statements true. | |
| From: Crispin Wright (Frege's Concept of Numbers as Objects [1983], Intro) | |
| A reaction: [He also asks about how we know the truths] |
| 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) |
| 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) |
| 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) |
| 13894 | Sameness of number is fundamental, not counting, despite children learning that first [Wright,C] |
| Full Idea: We teach our children to count, sometimes with no attempt to explain what the sounds mean. Doubtless it is this habit which makes it so natural to think of the number series as fundamental. Frege's insight is that sameness of number is fundamental. | |
| From: Crispin Wright (Frege's Concept of Numbers as Objects [1983], 3.xv) | |
| A reaction: 'When do children understand number?' rather than when they can recite numerals. I can't make sense of someone being supposed to understand number without a grasp of which numbers are bigger or smaller. To make 13='15' do I add or subtract? |
| 10140 | We derive Hume's Law from Law V, then discard the latter in deriving arithmetic [Wright,C, by Fine,K] |
| Full Idea: Wright says the Fregean arithmetic can be broken down into two steps: first, Hume's Law may be derived from Law V; and then, arithmetic may be derived from Hume's Law without any help from Law V. | |
| From: report of Crispin Wright (Frege's Concept of Numbers as Objects [1983]) by Kit Fine - The Limits of Abstraction I.4 | |
| A reaction: This sounds odd if Law V is false, but presumably Hume's Law ends up as free-standing. It seems doubtful whether the resulting theory would count as logic. |
| 8692 | Frege has a good system if his 'number principle' replaces his basic law V [Wright,C, by Friend] |
| Full Idea: Wright proposed removing Frege's basic law V (which led to paradox), replacing it with Frege's 'number principle' (identity of numbers is one-to-one correspondence). The new system is formally consistent, and the Peano axioms can be derived from it. | |
| From: report of Crispin Wright (Frege's Concept of Numbers as Objects [1983]) by Michčle Friend - Introducing the Philosophy of Mathematics 3.7 | |
| A reaction: The 'number principle' is also called 'Hume's principle'. This idea of Wright's resurrected the project of logicism. The jury is ought again... Frege himself questioned whether the number principle was a part of logic, which would be bad for 'logicism'. |
| 17440 | Wright says Hume's Principle is analytic of cardinal numbers, like a definition [Wright,C, by Heck] |
| Full Idea: Wright intends the claim that Hume's Principle (HP) embodies an explanation of the concept of number to imply that it is analytic of the concept of cardinal number - so it is an analytic or conceptual truth, much as a definition would be. | |
| From: report of Crispin Wright (Frege's Concept of Numbers as Objects [1983]) by Richard G. Heck - Cardinality, Counting and Equinumerosity 1 | |
| A reaction: Boolos is quoted as disagreeing. Wright is claiming a fundamental truth. Boolos says something can fix the character of something (as yellow fixes bananas), but that doesn't make it 'fundamental'. I want to defend 'fundamental'. |
| 13893 | It is 1-1 correlation of concepts, and not progression, which distinguishes natural number [Wright,C] |
| Full Idea: What is fundamental to possession of any notion of natural number at all is not the knowledge that the numbers may be arrayed in a progression but the knowledge that they are identified and distinguished by reference to 1-1 correlation among concepts. | |
| From: Crispin Wright (Frege's Concept of Numbers as Objects [1983], 3.xv) | |
| A reaction: My question is 'what is the essence of number?', and my inclination to disagree with Wright on this point suggests that the essence of number is indeed caught in the Dedekind-Peano axioms. But what of infinite numbers? |
| 13888 | If numbers are extensions, Frege must first solve the Caesar problem for extensions [Wright,C] |
| Full Idea: Identifying numbers with extensions will not solve the Caesar problem for numbers unless we have already solved the Caesar problem for extensions. | |
| From: Crispin Wright (Frege's Concept of Numbers as Objects [1983], 3.xiv) |
| 13869 | Number platonism says that natural number is a sortal concept [Wright,C] |
| Full Idea: Number-theoretic platonism is just the thesis that natural number is a sortal concept. | |
| From: Crispin Wright (Frege's Concept of Numbers as Objects [1983], 1.i) | |
| A reaction: See Crispin Wright on sortals to expound this. An odd way to express platonism, but he is presenting the Fregean version of it. |
| 13870 | We can't use empiricism to dismiss numbers, if numbers are our main evidence against empiricism [Wright,C] |
| Full Idea: We may not be able to settle whether some general form of empiricism is correct independently of natural numbers. It might be precisely our grasp of the abstract sortal, natural number, which shows the hypothesis of empiricism to be wrong. | |
| From: Crispin Wright (Frege's Concept of Numbers as Objects [1983], 1.i) | |
| A reaction: A nice turning of the tables. In the end only coherence decides these things. You may accept numbers and reject empiricism, and then find you have opened the floodgates for abstracta. Excessive floodgates, or blockages of healthy streams? |
| 13873 | Treating numbers adjectivally is treating them as quantifiers [Wright,C] |
| Full Idea: Treating numbers adjectivally is, in effect, treating the numbers as quantifiers. Frege observes that we can always parse out any apparently adjectival use of a number word in terms of substantival use. | |
| From: Crispin Wright (Frege's Concept of Numbers as Objects [1983], 1.iii) | |
| A reaction: The immediate response to this is that any substantival use can equally be expressed adjectivally. If you say 'the number of moons of Jupiter is four', I can reply 'oh, you mean Jupiter has four moons'. |
| 13899 | The Peano Axioms, and infinity of cardinal numbers, are logical consequences of how we explain cardinals [Wright,C] |
| Full Idea: The Peano Axioms are logical consequences of a statement constituting the core of an explanation of the notion of cardinal number. The infinity of cardinal numbers emerges as a consequence of the way cardinal number is explained. | |
| From: Crispin Wright (Frege's Concept of Numbers as Objects [1983], 4.xix) | |
| A reaction: This, along with Idea 13896, nicely summarises the neo-logicist project. I tend to favour a strategy which starts from ordering, rather than identities (1-1), but an attraction is that this approach is closer to counting objects in its basics. |
| 13896 | The aim is to follow Frege's strategy to derive the Peano Axioms, but without invoking classes [Wright,C] |
| Full Idea: We shall endeavour to see whether it is possible to follow through the strategy adumbrated in 'Grundlagen' for establishing the Peano Axioms without at any stage invoking classes. | |
| From: Crispin Wright (Frege's Concept of Numbers as Objects [1983], 4.xvi) | |
| A reaction: The key idea of neo-logicism. If you can avoid classes entirely, then set theory paradoxes become irrelevant, and classes aren't logic. Philosophers now try to derive the Peano Axioms from all sorts of things. Wright admits infinity is a problem. |
| 7804 | Wright has revived Frege's discredited logicism [Wright,C, by Benardete,JA] |
| Full Idea: Crispin Wright has reactivated Frege's logistic program, which for decades just about everybody assumed was a lost cause. | |
| From: report of Crispin Wright (Frege's Concept of Numbers as Objects [1983]) by José A. Benardete - Logic and Ontology 3 | |
| A reaction: [This opens Bernadete's section called "Back to Strong Logicism?"] |
| 13863 | Logicism seemed to fail by Russell's paradox, Gödel's theorems, and non-logical axioms [Wright,C] |
| Full Idea: Most would cite Russell's paradox, the non-logical character of the axioms which Russell and Whitehead's reconstruction of Frege's enterprise was constrained to employ, and the incompleteness theorems of Gödel, as decisive for logicism's failure. | |
| From: Crispin Wright (Frege's Concept of Numbers as Objects [1983], Intro) |
| 13895 | The standard objections are Russell's Paradox, non-logical axioms, and Gödel's theorems [Wright,C] |
| Full Idea: The general view is that Russell's Paradox put paid to Frege's logicist attempt, and Russell's own attempt is vitiated by the non-logical character of his axioms (esp. Infinity), and by the incompleteness theorems of Gödel. But these are bad reasons. | |
| From: Crispin Wright (Frege's Concept of Numbers as Objects [1983], 4.xvi) | |
| A reaction: Wright's work is the famous modern attempt to reestablish logicism, in the face of these objections. |
| 13884 | The idea that 'exist' has multiple senses is not coherent [Wright,C] |
| Full Idea: I have the gravest doubts whether any coherent account could be given of any multiplicity of senses of 'exist'. | |
| From: Crispin Wright (Frege's Concept of Numbers as Objects [1983], 2.x) | |
| A reaction: I thoroughly agree with this thought. Do water and wind exist in different senses of 'exist'? |
| 13877 | Singular terms in true sentences must refer to objects; there is no further question about their existence [Wright,C] |
| Full Idea: When a class of terms functions as singular terms, and the sentences are true, then those terms genuinely refer. Being singular terms, their reference is to objects. There is no further question whether they really refer, and there are such objects. | |
| From: Crispin Wright (Frege's Concept of Numbers as Objects [1983], 1.iii) | |
| A reaction: This seems to be a key sentence, because this whole view is standardly called 'platonic', but it certainly isn't platonism as we know it, Jim. Ontology has become an entirely linguistic matter, but do we then have 'sakes' and 'whereaboutses'? |
| 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. |
| 9878 | Contextually defined abstract terms genuinely refer to objects [Wright,C, by Dummett] |
| Full Idea: Wright says we should accord to contextually defined abstract terms a genuine full-blown reference to objects. | |
| From: report of Crispin Wright (Frege's Concept of Numbers as Objects [1983]) by Michael Dummett - Frege philosophy of mathematics Ch.18 | |
| A reaction: This is the punch line of Wright's neo-logicist programme. See Idea 9868 for his view of reference. Dummett regards this strong view of contextual definition as 'exorbitant'. Wright's view strikes me as blatantly false. |
| 13868 | Sortal concepts cannot require that things don't survive their loss, because of phase sortals [Wright,C] |
| Full Idea: The claim that no concept counts as sortal if an instance of it can survive its loss, runs foul of so-called phase sortals like 'embryo' and 'chrysalis'. | |
| From: Crispin Wright (Frege's Concept of Numbers as Objects [1983], 1.i) | |
| A reaction: The point being that those items only fall under that sortal for one phase of their career, and of their identity. I've always thought such claims absurd, and this gives a good reason for my view. |
| 12189 | Logical necessity involves a decision about usage, and is non-realist and non-cognitive [Wright,C, by McFetridge] |
| Full Idea: Wright espouses a non-realist, indeed non-cognitive account of logical necessity. Crucial to this is the idea that acceptance of a statement as necessary always involves an element of decision (to use it in a necessary way). | |
| From: report of Crispin Wright (Inventing Logical Necessity [1986]) by Ian McFetridge - Logical Necessity: Some Issues §3 | |
| A reaction: This has little appeal to me, as I take (unfashionably) the view that that logical necessity is rooted in the behaviour of the actual physical world, with which you can't argue. We test simple logic by making up examples. |
| 13865 | 'Sortal' concepts show kinds, use indefinite articles, and require grasping identities [Wright,C] |
| Full Idea: A concept is 'sortal' if it exemplifies a kind of object. ..In English predication of a sortal concept needs an indefinite article ('an' elm). ..What really constitutes the distinction is that it involves grasping identity for things which fall under it. | |
| From: Crispin Wright (Frege's Concept of Numbers as Objects [1983], 1.i) | |
| A reaction: This is a key notion, which underlies the claims of 'sortal essentialism' (see David Wiggins). |
| 13866 | A concept is only a sortal if it gives genuine identity [Wright,C] |
| Full Idea: Before we can conclude that φ expresses a sortal concept, we need to ensure that 'is the same φ as' generates statements of genuine identity rather than of some other equivalence relation. | |
| From: Crispin Wright (Frege's Concept of Numbers as Objects [1983], 1.i) |
| 13890 | Entities fall under a sortal concept if they can be used to explain identity statements concerning them [Wright,C] |
| Full Idea: 'Tree' is not a sortal concept under which directions fall since we cannot adequately explain the truth-conditions of any identity statement involving a pair of tree-denoting singular terms by appealing to facts to do with parallelism between lines. | |
| From: Crispin Wright (Frege's Concept of Numbers as Objects [1983], 3.xiv) | |
| A reaction: The idea seems to be that these two fall under 'hedgehog', because that is a respect in which they are identical. I like to notion of explanation as a part of this. |
| 13898 | If we can establish directions from lines and parallelism, we were already committed to directions [Wright,C] |
| Full Idea: The fact that it seems possible to establish a sortal notion of direction by reference to lines and parallelism, discloses tacit commitments to directions in statements about parallelism...There is incoherence in the idea that a line might lack direction. | |
| From: Crispin Wright (Frege's Concept of Numbers as Objects [1983], 4.xviii) | |
| A reaction: This seems like a slippery slope into a very extravagant platonism about concepts. Are concepts like direction as much a part of the natural world as rivers are? What other undiscovered concepts await us? |
| 13882 | A milder claim is that understanding requires some evidence of that understanding [Wright,C] |
| Full Idea: A mild version of the verification principle would say that it makes sense to think of someone as understanding an expression only if he is able, by his use of the expression, to give the best possible evidence that he understands it. | |
| From: Crispin Wright (Frege's Concept of Numbers as Objects [1983], 1.vii) | |
| A reaction: That doesn't seem to tell us what understanding actually consists of, and may just be the truism that to demonstrate anything whatsoever will necessarily involve some evidence. |
| 7320 | Holism cannot give a coherent account of scientific methodology [Wright,C, by Miller,A] |
| Full Idea: Crispin Wright has argued that Quine's holism is implausible because it is actually incoherent: he claims that Quine's holism cannot provide us with a coherent account of scientific methodology. | |
| From: report of Crispin Wright (Inventing Logical Necessity [1986]) by Alexander Miller - Philosophy of Language 4.5 | |
| A reaction: This sounds promising, given my intuitive aversion to linguistic holism, and almost everything to do with Quine. Scientific methodology is not isolated, but spreads into our ordinary (experimental) interactions with the world (e.g. Idea 2461). |
| 13885 | If apparent reference can mislead, then so can apparent lack of reference [Wright,C] |
| Full Idea: If the appearance of reference can be misleading, why cannot an apparent lack of reference be misleading? | |
| From: Crispin Wright (Frege's Concept of Numbers as Objects [1983], 2.xi) | |
| A reaction: A nice simple thought. Analytic philosophy has concerned itself a lot with sentences that seem to refer, but the reference can be analysed away. For me, this takes the question of reference out of the linguistic sphere, which wasn't Wright's plan. |
| 17857 | We can accept Frege's idea of object without assuming that predicates have a reference [Wright,C] |
| Full Idea: The heart of the problem is Frege's assumption that predicates have Bedeutungen at all; and no reason is at present evident why someone who espouses Frege's notion of object is contrained to make that assumption. | |
| From: Crispin Wright (Frege's Concept of Numbers as Objects [1983], 1.iv) | |
| A reaction: This seems like a penetrating objection to Frege's view of reference, and presumably supports the Kripke approach. |