30 ideas
| 17926 | Rejecting double negation elimination undermines reductio proofs [Colyvan] |
| Full Idea: The intuitionist rejection of double negation elimination undermines the important reductio ad absurdum proof in classical mathematics. | |
| From: Mark Colyvan (Introduction to the Philosophy of Mathematics [2012], 1.1.3) |
| 17925 | Showing a disproof is impossible is not a proof, so don't eliminate double negation [Colyvan] |
| Full Idea: In intuitionist logic double negation elimination fails. After all, proving that there is no proof that there can't be a proof of S is not the same thing as having a proof of S. | |
| From: Mark Colyvan (Introduction to the Philosophy of Mathematics [2012], 1.1.3) | |
| A reaction: I do like people like Colyvan who explain things clearly. All of this difficult stuff is understandable, if only someone makes the effort to explain it properly. |
| 17924 | Excluded middle says P or not-P; bivalence says P is either true or false [Colyvan] |
| Full Idea: The law of excluded middle (for every proposition P, either P or not-P) must be carefully distinguished from its semantic counterpart bivalence, that every proposition is either true or false. | |
| From: Mark Colyvan (Introduction to the Philosophy of Mathematics [2012], 1.1.3) | |
| A reaction: So excluded middle makes no reference to the actual truth or falsity of P. It merely says P excludes not-P, and vice versa. |
| 17929 | Löwenheim proved his result for a first-order sentence, and Skolem generalised it [Colyvan] |
| Full Idea: Löwenheim proved that if a first-order sentence has a model at all, it has a countable model. ...Skolem generalised this result to systems of first-order sentences. | |
| From: Mark Colyvan (Introduction to the Philosophy of Mathematics [2012], 2.1.2) |
| 17930 | Axioms are 'categorical' if all of their models are isomorphic [Colyvan] |
| Full Idea: A set of axioms is said to be 'categorical' if all models of the axioms in question are isomorphic. | |
| From: Mark Colyvan (Introduction to the Philosophy of Mathematics [2012], 2.1.2) | |
| A reaction: The best example is the Peano Axioms, which are 'true up to isomorphism'. Set theory axioms are only 'quasi-isomorphic'. |
| 17928 | Ordinal numbers represent order relations [Colyvan] |
| Full Idea: Ordinal numbers represent order relations. | |
| From: Mark Colyvan (Introduction to the Philosophy of Mathematics [2012], 1.2.3 n17) |
| 17923 | Intuitionists only accept a few safe infinities [Colyvan] |
| Full Idea: For intuitionists, all but the smallest, most well-behaved infinities are rejected. | |
| From: Mark Colyvan (Introduction to the Philosophy of Mathematics [2012], 1.1.3) | |
| A reaction: The intuitionist idea is to only accept what can be clearly constructed or proved. |
| 17941 | Infinitesimals were sometimes zero, and sometimes close to zero [Colyvan] |
| Full Idea: The problem with infinitesimals is that in some places they behaved like real numbers close to zero but in other places they behaved like zero. | |
| From: Mark Colyvan (Introduction to the Philosophy of Mathematics [2012], 7.1.2) | |
| A reaction: Colyvan gives an example, of differentiating a polynomial. |
| 17922 | Reducing real numbers to rationals suggested arithmetic as the foundation of maths [Colyvan] |
| Full Idea: Given Dedekind's reduction of real numbers to sequences of rational numbers, and other known reductions in mathematics, it was tempting to see basic arithmetic as the foundation of mathematics. | |
| From: Mark Colyvan (Introduction to the Philosophy of Mathematics [2012], 1.1.1) | |
| A reaction: The reduction is the famous Dedekind 'cut'. Nowadays theorists seem to be more abstract (Category Theory, for example) instead of reductionist. |
| 17936 | Transfinite induction moves from all cases, up to the limit ordinal [Colyvan] |
| Full Idea: Transfinite inductions are inductive proofs that include an extra step to show that if the statement holds for all cases less than some limit ordinal, the statement also holds for the limit ordinal. | |
| From: Mark Colyvan (Introduction to the Philosophy of Mathematics [2012], 5.2.1 n11) |
| 17940 | Most mathematical proofs are using set theory, but without saying so [Colyvan] |
| Full Idea: Most mathematical proofs, outside of set theory, do not explicitly state the set theory being employed. | |
| From: Mark Colyvan (Introduction to the Philosophy of Mathematics [2012], 7.1.1) |
| 17931 | Structuralism say only 'up to isomorphism' matters because that is all there is to it [Colyvan] |
| Full Idea: Structuralism is able to explain why mathematicians are typically only interested in describing the objects they study up to isomorphism - for that is all there is to describe. | |
| From: Mark Colyvan (Introduction to the Philosophy of Mathematics [2012], 3.1.2) |
| 17932 | If 'in re' structures relies on the world, does the world contain rich enough structures? [Colyvan] |
| Full Idea: In re structuralism does not posit anything other than the kinds of structures that are in fact found in the world. ...The problem is that the world may not provide rich enough structures for the mathematics. | |
| From: Mark Colyvan (Introduction to the Philosophy of Mathematics [2012], 3.1.2) | |
| A reaction: You can perceive a repeating pattern in the world, without any interest in how far the repetitions extend. |
| 16078 | Clay is intrinsically and atomically the same as statue (and that lacks 'modal properties') [Rudder Baker] |
| Full Idea: Arguments for statue being the clay are: that the clay is intrinsically like the statue, that the clay has the same atoms as the statue', that objects don't have modal properties such as being necessarily F, and the reference of 'property' changes. | |
| From: Lynne Rudder Baker (Why Constitution is not Identity [1997], II) | |
| A reaction: [my summary of the arguments she identifies - see text for details] Rudder Baker attempts to refute all four of these arguments, in defence of constitution as different from identity. |
| 16077 | The clay is not a statue - it borrows that property from the statue it constitutes [Rudder Baker] |
| Full Idea: I argue that a lump of clay borrows the property of being a statue from the statue. The lump is a statue because, and only because, there is something that the lump constitutes that is a statue. | |
| From: Lynne Rudder Baker (Why Constitution is not Identity [1997], n9) | |
| A reaction: It is skating on very thin metaphysical ice to introduce the concept of 'borrowing' a property. I've spent the last ten minutes trying to 'borrow' some properties, but without luck. |
| 16080 | Is it possible for two things that are identical to become two separate things? [Rudder Baker] |
| Full Idea: A strong intuition shared by many philosophers is that some things that are in fact identical might not have been identical. | |
| From: Lynne Rudder Baker (Why Constitution is not Identity [1997], IV) | |
| A reaction: This flies in the face of the Kripkean view that if Hesperus=Phosphorus then the identity is necessary. I don't think I have an intuition that some given thing might have been two things - indeed the thought seems totally weird. Amoeba? Statue/clay? |
| 16076 | Constitution is not identity, as consideration of essential predicates shows [Rudder Baker] |
| Full Idea: I want to resuscitate an essentialist argument against the view that constitution is identity, of the form 'x is essentially F, y is not essentially F, so x is not y'. | |
| From: Lynne Rudder Baker (Why Constitution is not Identity [1997], Intro) | |
| A reaction: The point is that x might be essentially F and y only accidentally F. Thus a statue is essentially so, but a lump if clay is not essentially a statue. Another case where 'necessary' would do instead of 'essentially'. |
| 16081 | The constitution view gives a unified account of the relation of persons/bodies, statues/bronze etc [Rudder Baker] |
| Full Idea: Constitution-without-identity is superior to constitution-as-identity in that it provides a unified view of the relation between persons and bodies, statues and pieces of bronze, and so on. | |
| From: Lynne Rudder Baker (Why Constitution is not Identity [1997], IV) | |
| A reaction: I have a problem with the intrinsic dualism of this whole picture. Clay needs shape, statues need matter - there aren't two 'things' here which have a 'relation'. |
| 16082 | Statues essentially have relational properties lacked by lumps [Rudder Baker] |
| Full Idea: The statue has relational properties which the lump of clay does not have essentially. | |
| From: Lynne Rudder Baker (Why Constitution is not Identity [1997], V) | |
| A reaction: She has in mind relations to the community of artistic life. I don't think this is convincing. Is something only a statue if it is validated by an artistic community? That sounds like relative identity, which she doesn't like. |
| 9329 | Justification is coherence with a background system; if irrefutable, it is knowledge [Lehrer] |
| Full Idea: Justification is coherence with a background system which, when irrefutable, converts to knowledge. | |
| From: Keith Lehrer (Consciousness,Represn, and Knowledge [2006]) | |
| A reaction: A problem (as the theory stands here) would be whether you have to be aware that the coherence is irrefutable, which would seem to require a pretty powerful intellect. If one needn't be aware of the irrefutability, how does it help my justification? |
| 17943 | Probability supports Bayesianism better as degrees of belief than as ratios of frequencies [Colyvan] |
| Full Idea: Those who see probabilities as ratios of frequencies can't use Bayes's Theorem if there is no objective prior probability. Those who accept prior probabilities tend to opt for a subjectivist account, where probabilities are degrees of belief. | |
| From: Mark Colyvan (Introduction to the Philosophy of Mathematics [2012], 9.1.8) | |
| A reaction: [compressed] |
| 17939 | Mathematics can reveal structural similarities in diverse systems [Colyvan] |
| Full Idea: Mathematics can demonstrate structural similarities between systems (e.g. missing population periods and the gaps in the rings of Saturn). | |
| From: Mark Colyvan (Introduction to the Philosophy of Mathematics [2012], 6.3.2) | |
| A reaction: [Colyvan expounds the details of his two examples] It is these sorts of results that get people enthusiastic about the mathematics embedded in nature. A misunderstanding, I think. |
| 17938 | Mathematics can show why some surprising events have to occur [Colyvan] |
| Full Idea: Mathematics can show that under a broad range of conditions, something initially surprising must occur (e.g. the hexagonal structure of honeycomb). | |
| From: Mark Colyvan (Introduction to the Philosophy of Mathematics [2012], 6.3.2) |
| 17934 | Proof by cases (by 'exhaustion') is said to be unexplanatory [Colyvan] |
| Full Idea: Another style of proof often cited as unexplanatory are brute-force methods such as proof by cases (or proof by exhaustion). | |
| From: Mark Colyvan (Introduction to the Philosophy of Mathematics [2012], 5.2.1) |
| 17933 | Reductio proofs do not seem to be very explanatory [Colyvan] |
| Full Idea: One kind of proof that is thought to be unexplanatory is the 'reductio' proof. | |
| From: Mark Colyvan (Introduction to the Philosophy of Mathematics [2012], 5.2.1) | |
| A reaction: Presumably you generate a contradiction, but are given no indication of why the contradiction has arisen? Tracking back might reveal the source of the problem? Colyvan thinks reductio can be explanatory. |
| 17935 | If inductive proofs hold because of the structure of natural numbers, they may explain theorems [Colyvan] |
| Full Idea: It might be argued that any proof by induction is revealing the explanation of the theorem, namely, that it holds by virtue of the structure of the natural numbers. | |
| From: Mark Colyvan (Introduction to the Philosophy of Mathematics [2012], 5.2.1) | |
| A reaction: This is because induction characterises the natural numbers, in the Peano Axioms. |
| 17942 | Can a proof that no one understands (of the four-colour theorem) really be a proof? [Colyvan] |
| Full Idea: The proof of the four-colour theorem raises questions about whether a 'proof' that no one understands is a proof. | |
| From: Mark Colyvan (Introduction to the Philosophy of Mathematics [2012], 9.1.6) | |
| A reaction: The point is that the theorem (that you can colour countries on a map with just four colours) was proved with the help of a computer. |
| 17937 | Mathematical generalisation is by extending a system, or by abstracting away from it [Colyvan] |
| Full Idea: One type of generalisation in mathematics extends a system to go beyond what is was originally set up for; another kind involves abstracting away from some details in order to capture similarities between different systems. | |
| From: Mark Colyvan (Introduction to the Philosophy of Mathematics [2012], 5.2.2) |
| 9330 | Generalization seems to be more fundamental to minds than spotting similarities [Lehrer] |
| Full Idea: There is a level of generalization we share with other animals in the responses to objects that suggest that generalization is a more fundamental operation of the mind than the observation of similarities. | |
| From: Keith Lehrer (Consciousness,Represn, and Knowledge [2006]) | |
| A reaction: He derives this from Reid (1785) - Lehrer's hero - who argued against Hume that we couldn't spot similarities if we hadn't already generalized to produce the 'respect' of the similarity. Interesting. I think Reid must be right. |
| 9328 | All conscious states can be immediately known when attention is directed to them [Lehrer] |
| Full Idea: I am inclined to think that all conscious states can be immediately known when attention is directed to them. | |
| From: Keith Lehrer (Consciousness,Represn, and Knowledge [2006]) | |
| A reaction: This strikes me as a very helpful suggestion, for eliminating lots of problem cases for introspective knowledge which have been triumphally paraded in recent times. It might, though, be tautological, if it is actually a definition of 'conscious states'. |