31 ideas
| 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. |
| 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) |
| 18739 | Three stages of philosophical logic: syntactic (1905-55), possible worlds (1963-85), widening (1990-) [Horsten/Pettigrew] |
| Full Idea: Three periods can be distinguished in philosophical logic: the syntactic stage, from Russell's definite descriptions to the 1950s, the dominance of possible world semantics from the 50s to 80s, and a current widening of the subject. | |
| From: Horsten,L/Pettigrew,R (Mathematical Methods in Philosophy [2014], 1) | |
| A reaction: [compressed] I've read elsewhere that the arrival of Tarski's account of truth in 1933, taking things beyond the syntactic, was also a landmark. |
| 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. |
| 18741 | Logical formalization makes concepts precise, and also shows their interrelation [Horsten/Pettigrew] |
| Full Idea: Logical formalization forces the investigator to make the central philosophical concepts precise. It can also show how some philosophical concepts and objects can be defined in terms of others. | |
| From: Horsten,L/Pettigrew,R (Mathematical Methods in Philosophy [2014], 2) | |
| A reaction: This is the main rationale of the highly formal and mathematical approach to such things. The downside is when you impose 'precision' on language that was never intended to be precise. |
| 18744 | Models are sets with functions and relations, and truth built up from the components [Horsten/Pettigrew] |
| Full Idea: A (logical) model is a set with functions and relations defined on it that specify the denotation of the non-logical vocabulary. A series of recursive clauses explicate how truth values of complex sentences are compositionally determined from the parts. | |
| From: Horsten,L/Pettigrew,R (Mathematical Methods in Philosophy [2014], 3) | |
| A reaction: See the ideas on 'Functions in logic' and 'Relations in logic' (in the alphabetical list) to expand this important idea. |
| 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. |
| 18740 | If 'exist' doesn't express a property, we can hardly ask for its essence [Horsten/Pettigrew] |
| Full Idea: If there is indeed no property of existence that is expressed by the word 'exist', then it makes no sense to ask for its essence. | |
| From: Horsten,L/Pettigrew,R (Mathematical Methods in Philosophy [2014], 2) | |
| A reaction: As far as I can tell, this was exactly Aristotle's conclusion, so he skirted round the question of 'being qua being', and focused on the nature of objects instead. Grand continental talk of 'Being' doesn't sound very interesting. |
| 12697 | Indivisibles are not parts, but the extrema of parts [Leibniz] |
| Full Idea: Indivisibles are not parts, but the extrema of parts. | |
| From: Gottfried Leibniz (Pacidius Philalethi dialogue [1676], A6.3.565-6), quoted by Daniel Garber - Leibniz:Body,Substance,Monad 1 | |
| A reaction: This is incipient monadology, that the bottom level of division ceases to be parts of a thing, and arrives at a different order of entity, to explain the parts of things. Leibniz denies that this subdivision comes down to points. |
| 18745 | A Tarskian model can be seen as a possible state of affairs [Horsten/Pettigrew] |
| Full Idea: A Tarskian model can in a sense be seen as a model of a possible state of affairs. | |
| From: Horsten,L/Pettigrew,R (Mathematical Methods in Philosophy [2014], 3) | |
| A reaction: I include this remark to show how possible worlds semantics built on the arrival of model theory. |
| 18747 | The 'spheres model' was added to possible worlds, to cope with counterfactuals [Horsten/Pettigrew] |
| Full Idea: The notion of a possible worlds model was extended (resulting in the concept of a 'spheres model') in order to obtain a satisfactory logical treatment of counterfactual conditional sentences. | |
| From: Horsten,L/Pettigrew,R (Mathematical Methods in Philosophy [2014], 4) | |
| A reaction: Thus we add 'centred' worlds, and an 'actual' world, to the loose original model. It is important to remember when we discuss 'close' worlds that we are then committed to these presuppositions. |
| 18748 | Epistemic logic introduced impossible worlds [Horsten/Pettigrew] |
| Full Idea: The idea of 'impossible worlds' was introduced into epistemic logic. | |
| From: Horsten,L/Pettigrew,R (Mathematical Methods in Philosophy [2014], 4) | |
| A reaction: Nathan Salmon seems interested in their role in metaphysics (presumably in relation to Meinongian impossible objects, like circular squares, which must necessarily be circular). |
| 18746 | Possible worlds models contain sets of possible worlds; this is a large metaphysical commitment [Horsten/Pettigrew] |
| Full Idea: Each possible worlds model contains a set of possible worlds. For this reason, possible worlds semantics is often charged with smuggling in heavy metaphysical commitments. | |
| From: Horsten,L/Pettigrew,R (Mathematical Methods in Philosophy [2014], 3) | |
| A reaction: To a beginner it looks very odd that you should try to explain possibility by constructing a model of it in terms of 'possible' worlds. |
| 18750 | Using possible worlds for knowledge and morality may be a step too far [Horsten/Pettigrew] |
| Full Idea: When the possible worlds semantics were further extended to model notions of knowledge and of moral obligation, the application was beginning to look distinctly forced and artificial. | |
| From: Horsten,L/Pettigrew,R (Mathematical Methods in Philosophy [2014], 5) | |
| A reaction: They accept lots of successes in modelling necessity and time. |
| 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) |
| 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. |
| 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) |
| 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) |