33 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'. |
| 17453 | The meaning of a number isn't just the numerals leading up to it [Heck] |
| Full Idea: My knowing what the number '33' denotes cannot consist in my knowing that it denotes the number of decimal numbers between '1' and '33', because I would know that even if it were in hexadecimal (which I don't know well). | |
| From: Richard G. Heck (Cardinality, Counting and Equinumerosity [2000], 5) | |
| A reaction: Obviously you wouldn't understand '33' if you didn't understand what '33 things' meant. |
| 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) |
| 17457 | A basic grasp of cardinal numbers needs an understanding of equinumerosity [Heck] |
| Full Idea: An appreciation of the connection between sameness of number and equinumerosity that it reports is essential to even the most primitive grasp of the concept of cardinal number. | |
| From: Richard G. Heck (Cardinality, Counting and Equinumerosity [2000], 6) |
| 17448 | In counting, numerals are used, not mentioned (as objects that have to correlated) [Heck] |
| Full Idea: One need not conceive of the numerals as objects in their own right in order to count. The numerals are not mentioned in counting (as objects to be correlated with baseball players), but are used. | |
| From: Richard G. Heck (Cardinality, Counting and Equinumerosity [2000], 3) | |
| A reaction: He observes that when you name the team, you aren't correlating a list of names with the players. I could correlate any old tags with some objects, and you could tell me the cardinality denoted by the last tag. I do ordinals, you do cardinals. |
| 17455 | Is counting basically mindless, and independent of the cardinality involved? [Heck] |
| Full Idea: I am not denying that counting can be done mindlessly, without making judgments of cardinality along the way. ...But the question is whether counting is, as it were, fundamentally a mindless exercise. | |
| From: Richard G. Heck (Cardinality, Counting and Equinumerosity [2000], 5) | |
| A reaction: He says no. It seems to me like going on a journey, where you can forget where you are going and where you have got to so far, but those underlying facts are always there. If you just tag things with unknown foreign numbers, you aren't really counting. |
| 17456 | Counting is the assignment of successively larger cardinal numbers to collections [Heck] |
| Full Idea: Counting is not mere tagging: it is the successive assignment of cardinal numbers to increasingly large collections of objects. | |
| From: Richard G. Heck (Cardinality, Counting and Equinumerosity [2000], 5) | |
| A reaction: That the cardinals are 'successive' seems to mean that they are ordinals as well. If you don't know that 'seven' means a cardinality, as well as 'successor of six', you haven't understood it. Days of the week have successors. Does PA capture cardinality? |
| 17450 | Understanding 'just as many' needn't involve grasping one-one correspondence [Heck] |
| Full Idea: It is far from obvious that knowing what 'just as many' means requires knowing what a one-one correspondence is. The notion of a one-one correspondence is very sophisticated, and it is far from clear that five-year-olds have any grasp of it. | |
| From: Richard G. Heck (Cardinality, Counting and Equinumerosity [2000], 4) | |
| A reaction: The point is that children decide 'just as many' by counting each group and arriving at the same numeral, not by matching up. He cites psychological research by Gelman and Galistel. |
| 17451 | We can know 'just as many' without the concepts of equinumerosity or numbers [Heck] |
| Full Idea: 'Just as many' is independent of the ability to count, and we shouldn't characterise equinumerosity through counting. It is also independent of the concept of number. Enough cookies to go round doesn't need how many cookies. | |
| From: Richard G. Heck (Cardinality, Counting and Equinumerosity [2000], 4) | |
| A reaction: [compressed] He talks of children having an 'operational' ability which is independent of these more sophisticated concepts. Interesting. You see how early man could relate 'how many' prior to the development of numbers. |
| 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. |
| 17459 | Frege's Theorem explains why the numbers satisfy the Peano axioms [Heck] |
| Full Idea: The interest of Frege's Theorem is that it offers us an explanation of the fact that the numbers satisfy the Dedekind-Peano axioms. | |
| From: Richard G. Heck (Cardinality, Counting and Equinumerosity [2000], 6) | |
| A reaction: He says 'explaining' does not make it more fundamental, since all proofs explain why their conclusions hold. |
| 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. |
| 17454 | Children can use numbers, without a concept of them as countable objects [Heck] |
| Full Idea: For a long time my daughter had no understanding of the question of how many numerals or numbers there are between 'one' and 'five'. I think she lacked the concept of numerals as objects which can themselves be counted. | |
| From: Richard G. Heck (Cardinality, Counting and Equinumerosity [2000], 5) | |
| A reaction: I can't make any sense of numbers actually being objects, though clearly treating all sorts of things as objects helps thinking (as in 'the victory is all that matters'). |
| 17458 | Equinumerosity is not the same concept as one-one correspondence [Heck] |
| Full Idea: Equinumerosity is not the same concept as being in one-one correspondence with. | |
| From: Richard G. Heck (Cardinality, Counting and Equinumerosity [2000], 6) | |
| A reaction: He says this is the case, even if they are coextensive, like renate and cordate. You can see that five loaves are equinumerous with five fishes, without doing a one-one matchup. |
| 17449 | We can understand cardinality without the idea of one-one correspondence [Heck] |
| Full Idea: One can have a perfectly serviceable concept of cardinality without so much as having the concept of one-one correspondence. | |
| From: Richard G. Heck (Cardinality, Counting and Equinumerosity [2000], 3) | |
| A reaction: This is the culmination of a lengthy discussion. It includes citations about the psychology of children's counting. Cardinality needs one group of things, and 1-1 needs two groups. |
| 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) |
| 468 | Musical performance can reveal a range of virtues [Damon of Ath.] |
| Full Idea: In singing and playing the lyre, a boy will be likely to reveal not only courage and moderation, but also justice. | |
| From: Damon (fragments/reports [c.460 BCE], B4), quoted by (who?) - where? |