77 ideas
| 18074 | Intuitionists rely on assertability instead of truth, but assertability relies on truth [Kitcher] |
| Full Idea: Though it may appear that the intuitionist is providing an account of the connectives couched in terms of assertability conditions, the notion of assertability is a derivative one, ultimately cashed out by appealing to the concept of truth. | |
| From: Philip Kitcher (The Nature of Mathematical Knowledge [1984], 06.5) | |
| A reaction: I have quite a strong conviction that Kitcher is right. All attempts to eliminate truth, as some sort of ideal at the heart of ordinary talk and of reasoning, seems to me to be doomed. |
| 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. |
| 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) |
| 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. |
| 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. |
| 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) |
| 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) |
| 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) |
| 6298 | Kitcher says maths is an idealisation of the world, and our operations in dealing with it [Kitcher, by Resnik] |
| Full Idea: Kitcher says maths is an 'idealising theory', like some in physics; maths idealises features of the world, and practical operations, such as segregating and matching (numbering), measuring, cutting, moving, assembling (geometry), and collecting (sets). | |
| From: report of Philip Kitcher (The Nature of Mathematical Knowledge [1984]) by Michael D. Resnik - Maths as a Science of Patterns One.4.2.2 | |
| A reaction: This seems to be an interesting line, which is trying to be fairly empirical, and avoid basing mathematics on purely a priori understanding. Nevertheless, we do not learn idealisation from experience. Resnik labels Kitcher an anti-realist. |
| 12392 | Mathematical a priorism is conceptualist, constructivist or realist [Kitcher] |
| Full Idea: Proposals for a priori mathematical knowledge have three main types: conceptualist (true in virtue of concepts), constructivist (a construct of the human mind) and realist (in virtue of mathematical facts). | |
| From: Philip Kitcher (The Nature of Mathematical Knowledge [1984], 02.3) | |
| A reaction: Realism is pure platonism. I think I currently vote for conceptualism, with the concepts deriving from the concrete world, and then being extended by fictional additions, and shifts in the notion of what 'number' means. |
| 18078 | The interest or beauty of mathematics is when it uses current knowledge to advance undestanding [Kitcher] |
| Full Idea: What makes a question interesting or gives it aesthetic appeal is its focussing of the project of advancing mathematical understanding, in light of the concepts and systems of beliefs already achieved. | |
| From: Philip Kitcher (The Nature of Mathematical Knowledge [1984], 09.3) | |
| A reaction: Kitcher defends explanation (the source of understanding, presumably) in terms of unification with previous theories (the 'concepts and systems'). I always have the impression that mathematicians speak of 'beauty' when they see economy of means. |
| 12426 | The 'beauty' or 'interest' of mathematics is just explanatory power [Kitcher] |
| Full Idea: Insofar as we can honor claims about the aesthetic qualities or the interest of mathematical inquiries, we should do so by pointing to their explanatory power. | |
| From: Philip Kitcher (The Nature of Mathematical Knowledge [1984], 09.4) | |
| A reaction: I think this is a good enough account for me (but probably not for my friend Carl!). Beautiful cars are particularly streamlined. Beautiful people look particularly healthy. A beautiful idea is usually wide-ranging. |
| 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) |
| 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) |
| 12395 | Real numbers stand to measurement as natural numbers stand to counting [Kitcher] |
| Full Idea: The real numbers stand to measurement as the natural numbers stand to counting. | |
| From: Philip Kitcher (The Nature of Mathematical Knowledge [1984], 06.4) |
| 12425 | Complex numbers were only accepted when a geometrical model for them was found [Kitcher] |
| Full Idea: An important episode in the acceptance of complex numbers was the development by Wessel, Argand, and Gauss, of a geometrical model of the numbers. | |
| From: Philip Kitcher (The Nature of Mathematical Knowledge [1984], 07.5) | |
| A reaction: The model was in terms of vectors and rotation. New types of number are spurned until they can be shown to integrate into a range of mathematical practice, at which point mathematicians change the meaning of 'number' (without consulting us). |
| 18071 | A one-operation is the segregation of a single object [Kitcher] |
| Full Idea: We perform a one-operation when we perform a segregative operation in which a single object is segregated. | |
| From: Philip Kitcher (The Nature of Mathematical Knowledge [1984], 06.3) | |
| A reaction: This is part of Kitcher's empirical but constructive account of arithmetic, which I find very congenial. He avoids the word 'unit', and goes straight to the concept of 'one' (which he treats as more primitive than zero). |
| 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? |
| 18066 | The old view is that mathematics is useful in the world because it describes the world [Kitcher] |
| Full Idea: There is an old explanation of the utility of mathematics. Mathematics describes the structural features of our world, features which are manifested in the behaviour of all the world's inhabitants. | |
| From: Philip Kitcher (The Nature of Mathematical Knowledge [1984], 06.1) | |
| A reaction: He only cites Russell in modern times as sympathising with this view, but Kitcher gives it some backing. I think the view is totally correct. The digression produced by Cantorian infinities has misled us. |
| 18083 | With infinitesimals, you divide by the time, then set the time to zero [Kitcher] |
| Full Idea: The method of infinitesimals is that you divide by the time, and then set the time to zero. | |
| From: Philip Kitcher (The Nature of Mathematical Knowledge [1984], 10.2) |
| 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) |
| 12393 | Intuition is no basis for securing a priori knowledge, because it is fallible [Kitcher] |
| Full Idea: The process of pure intuition does not measure up to the standards required of a priori warrants not because it is sensuous but because it is fallible. | |
| From: Philip Kitcher (The Nature of Mathematical Knowledge [1984], 03.2) |
| 18061 | Mathematical intuition is not the type platonism needs [Kitcher] |
| Full Idea: The intuitions of which mathematicians speak are not those which Platonism requires. | |
| From: Philip Kitcher (The Nature of Mathematical Knowledge [1984], 03.3) | |
| A reaction: The point is that it is not taken to be a 'special' ability, but rather a general insight arising from knowledge of mathematics. I take that to be a good account of intuition, which I define as 'inarticulate rationality'. |
| 12420 | If mathematics comes through intuition, that is either inexplicable, or too subjective [Kitcher] |
| Full Idea: If mathematical statements are don't merely report features of transient and private mental entities, it is unclear how pure intuition generates mathematical knowledge. But if they are, they express different propositions for different people and times. | |
| From: Philip Kitcher (The Nature of Mathematical Knowledge [1984], 03.1) | |
| A reaction: This seems to be the key dilemma which makes Kitcher reject intuition as an a priori route to mathematics. We do, though, just seem to 'see' truths sometimes, and are unable to explain how we do it. |
| 12387 | Mathematical knowledge arises from basic perception [Kitcher] |
| Full Idea: Mathematical knowledge arises from rudimentary knowledge acquired by perception. | |
| From: Philip Kitcher (The Nature of Mathematical Knowledge [1984], Intro) | |
| A reaction: This is an empiricist manifesto, which asserts his allegiance to Mill, and he gives a sophisticated account of how higher mathematics can be accounted for in this way. Well, he tries to. |
| 12412 | My constructivism is mathematics as an idealization of collecting and ordering objects [Kitcher] |
| Full Idea: The constructivist position I defend claims that mathematics is an idealized science of operations which can be performed on objects in our environment. It offers an idealized description of operations of collecting and ordering. | |
| From: Philip Kitcher (The Nature of Mathematical Knowledge [1984], Intro) | |
| A reaction: I think this is right. What is missing from Kitcher's account (and every other account I've met) is what is meant by 'idealization'. How do you go about idealising something? Hence my interest in the psychology of abstraction. |
| 18065 | We derive limited mathematics from ordinary things, and erect powerful theories on their basis [Kitcher] |
| Full Idea: I propose that a very limited amount of our mathematical knowledge can be obtained by observations and manipulations of ordinary things. Upon this small base we erect the powerful general theories of modern mathematics. | |
| From: Philip Kitcher (The Nature of Mathematical Knowledge [1984], 05.2) | |
| A reaction: I agree. The three related processes that take us from the experiential base of mathematics to its lofty heights are generalisation, idealisation and abstraction. |
| 18077 | The defenders of complex numbers had to show that they could be expressed in physical terms [Kitcher] |
| Full Idea: Proponents of complex numbers had ultimately to argue that the new operations shared with the original paradigms a susceptibility to construal in physical terms. The geometrical models of complex numbers answered to this need. | |
| From: Philip Kitcher (The Nature of Mathematical Knowledge [1984], 07.5) | |
| A reaction: [A nice example of the verbose ideas which this website aims to express in plain English!] The interest is not that they had to be described physically (which may pander to an uninformed audience), but that they could be so described. |
| 12423 | Analyticity avoids abstract entities, but can there be truth without reference? [Kitcher] |
| Full Idea: Philosophers who hope to avoid commitment to abstract entities by claiming that mathematical statements are analytic must show how analyticity is, or provides a species of, truth not requiring reference. | |
| From: Philip Kitcher (The Nature of Mathematical Knowledge [1984], 04.I) | |
| A reaction: [the last part is a quotation from W.D. Hart] Kitcher notes that Frege has a better account, because he provides objects to which reference can be made. I like this idea, which seems to raise a very large question, connected to truthmakers. |
| 18069 | Arithmetic is an idealizing theory [Kitcher] |
| Full Idea: I construe arithmetic as an idealizing theory. | |
| From: Philip Kitcher (The Nature of Mathematical Knowledge [1984], 06.2) | |
| A reaction: I find 'generalising' the most helpful word, because everyone seems to understand and accept the idea. 'Idealisation' invokes 'ideals', which lots of people dislike, and lots of philosophers seem to have trouble with 'abstraction'. |
| 18068 | Arithmetic is made true by the world, but is also made true by our constructions [Kitcher] |
| Full Idea: I want to suggest both that arithmetic owes its truth to the structure of the world and that arithmetic is true in virtue of our constructive activity. | |
| From: Philip Kitcher (The Nature of Mathematical Knowledge [1984], 06.2) | |
| A reaction: Well said, but the problem seems no more mysterious to me than the fact that trees grow in the woods and we build houses out of them. I think I will declare myself to be an 'empirical constructivist' about mathematics. |
| 18070 | We develop a language for correlations, and use it to perform higher level operations [Kitcher] |
| Full Idea: The development of a language for describing our correlational activity itself enables us to perform higher level operations. | |
| From: Philip Kitcher (The Nature of Mathematical Knowledge [1984], 06.2) | |
| A reaction: This is because all language itself (apart from proper names) is inherently general, idealised and abstracted. He sees the correlations as the nested collections expressed by set theory. |
| 18072 | Constructivism is ontological (that it is the work of an agent) and epistemological (knowable a priori) [Kitcher] |
| Full Idea: The constructivist ontological thesis is that mathematics owes its truth to the activity of an actual or ideal subject. The epistemological thesis is that we can have a priori knowledge of this activity, and so recognise its limits. | |
| From: Philip Kitcher (The Nature of Mathematical Knowledge [1984], 06.5) | |
| A reaction: The mention of an 'ideal' is Kitcher's personal view. Kitcher embraces the first view, and rejects the second. |
| 18063 | Conceptualists say we know mathematics a priori by possessing mathematical concepts [Kitcher] |
| Full Idea: Conceptualists claim that we have basic a priori knowledge of mathematical axioms in virtue of our possession of mathematical concepts. | |
| From: Philip Kitcher (The Nature of Mathematical Knowledge [1984], 04.1) | |
| A reaction: I sympathise with this view. If concepts are reasonably clear, they will relate to one another in certain ways. How could they not? And how else would you work out those relations other than by thinking about them? |
| 18064 | If meaning makes mathematics true, you still need to say what the meanings refer to [Kitcher] |
| Full Idea: Someone who believes that basic truths of mathematics are true in virtue of meaning is not absolved from the task of saying what the referents of mathematical terms are, or ...what mathematical reality is like. | |
| From: Philip Kitcher (The Nature of Mathematical Knowledge [1984], 04.6) | |
| A reaction: Nice question! He's a fan of getting at the explanatory in mathematics. |
| 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. |
| 18067 | Abstract objects were a bad way of explaining the structure in mathematics [Kitcher] |
| Full Idea: The original introduction of abstract objects was a bad way of doing justice to the insight that mathematics is concerned with structure. | |
| From: Philip Kitcher (The Nature of Mathematical Knowledge [1984], 06.1) | |
| A reaction: I'm a fan of explanations in metaphysics, and hence find the concept of 'bad' explanations in metaphysics particularly intriguing. |
| 12390 | A priori knowledge comes from available a priori warrants that produce truth [Kitcher] |
| Full Idea: X knows a priori that p iff the belief was produced with an a priori warrant, which is a process which is available to X, and this process is a warrant, and it makes p true. | |
| From: Philip Kitcher (The Nature of Mathematical Knowledge [1984], 01.4) | |
| A reaction: [compression of a formal spelling-out] This is a modified version of Goldman's reliabilism, for a priori knowledge. It sounds a bit circular and uninformative, but it's a start. |
| 12418 | In long mathematical proofs we can't remember the original a priori basis [Kitcher] |
| Full Idea: When we follow long mathematical proofs we lose our a priori warrants for their beginnings. | |
| From: Philip Kitcher (The Nature of Mathematical Knowledge [1984], 02.2) | |
| A reaction: Kitcher says Descartes complains about this problem several times in his 'Regulae'. The problem runs even deeper into all reasoning, if you become sceptical about memory. You have to remember step 1 when you do step 2. |
| 12389 | Knowledge is a priori if the experience giving you the concepts thus gives you the knowledge [Kitcher] |
| Full Idea: Knowledge is independent of experience if any experience which would enable us to acquire the concepts involved would enable us to have the knowledge. | |
| From: Philip Kitcher (The Nature of Mathematical Knowledge [1984], 01.3) | |
| A reaction: This is the 'conceptualist' view of a priori knowledge, which Kitcher goes on to attack, preferring a 'constructivist' view. The formula here shows that we can't divorce experience entirely from a priori thought. I find conceptualism a congenial view. |
| 12416 | We have some self-knowledge a priori, such as knowledge of our own existence [Kitcher] |
| Full Idea: One can make a powerful case for supposing that some self-knowledge is a priori. At most, if not all, of our waking moments, each of us knows of herself that she exists. | |
| From: Philip Kitcher (The Nature of Mathematical Knowledge [1984], 01.6) | |
| A reaction: This is a begrudging concession from a strong opponent to the whole notion of a priori knowledge. I suppose if you ask 'what can be known by thought alone?' then truths about thought ought to be fairly good initial candidates. |
| 12413 | A 'warrant' is a process which ensures that a true belief is knowledge [Kitcher] |
| Full Idea: A 'warrant' refers to those processes which produce belief 'in the right way': X knows that p iff p, and X believes that p, and X's belief that p was produced by a process which is a warrant for it. | |
| From: Philip Kitcher (The Nature of Mathematical Knowledge [1984], 01.2) | |
| A reaction: That is, a 'warrant' is a justification which makes a belief acceptable as knowledge. Traditionally, warrants give you certainty (and are, consequently, rather hard to find). I would say, in the modern way, that warrants are agreed by social convention. |
| 20473 | If experiential can defeat a belief, then its justification depends on the defeater's absence [Kitcher, by Casullo] |
| Full Idea: According to Kitcher, if experiential evidence can defeat someone's justification for a belief, then their justification depends on the absence of that experiential evidence. | |
| From: report of Philip Kitcher (The Nature of Mathematical Knowledge [1984], p.89) by Albert Casullo - A Priori Knowledge 2.3 | |
| A reaction: Sounds implausible. There are trillions of possible defeaters for most beliefs, but to say they literally depend on trillions of absences seems a very odd way of seeing the situation |
| 18075 | Idealisation trades off accuracy for simplicity, in varying degrees [Kitcher] |
| Full Idea: To idealize is to trade accuracy in describing the actual for simplicity of description, and the compromise can sometimes be struck in different ways. | |
| From: Philip Kitcher (The Nature of Mathematical Knowledge [1984], 06.5) | |
| A reaction: There is clearly rather more to idealisation than mere simplicity. A matchstick man is not an ideal man. |
| 7903 | 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'). |