29 ideas
| 21960 | Ordinary language is the beginning of philosophy, but there is much more to it [Austin,JL] |
| Full Idea: Ordinary language is not the last word: in principle it can everywhere be supplemented and improved upon and superseded. Only remember, it is the first word. | |
| From: J.L. Austin (A Plea for Excuses [1956], p.185), quoted by A.W. Moore - The Evolution of Modern Metaphysics Intro | |
| A reaction: To claim anything more would be absurd. The point is that this remark comes from the high priest of ordinary language philosophy. |
| 10835 | True sentences says the appropriate descriptive thing on the appropriate demonstrative occasion [Austin,JL] |
| Full Idea: A sentence is said to be true when the historic state of affairs to which it is correlated by the demonstrative conventions (the one to which it 'refers') is of a type with which the sentence used in making it is correlated by the descriptive conventions. | |
| From: J.L. Austin (Truth [1950], §3) | |
| A reaction: This is correspondence by convention rather than correspondence by mapping. Personally I prefer some sort of mapping account, despite all the difficulty and vagueness of specifying what maps onto what. |
| 10836 | Correspondence theorists shouldn't think that a country has just one accurate map [Austin,JL] |
| Full Idea: Correspondence theorists too often talk as one would who held that every map is either accurate or inaccurate; that every country can have but one accurate map. | |
| From: J.L. Austin (Truth [1950], n 24) | |
| A reaction: A well-made point, for those who intuitively hang on to correspondence as not only good common sense, but also some sort of salvation for a realist view of the world which might give us certainty in epistemology. |
| 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. |
| 16062 | A necessary relation between fact-levels seems to be a further irreducible fact [Lynch/Glasgow] |
| Full Idea: It seems unavoidable that the facts about logically necessary relations between levels of facts are themselves logically distinct further facts, irreducible to the microphysical facts. | |
| From: Lynch,MP/Glasgow,JM (The Impossibility of Superdupervenience [2003], C) | |
| A reaction: I'm beginning to think that rejecting every theory of reality that is proposed by carefully exposing some infinite regress hidden in it is a rather lazy way to do philosophy. Almost as bad as rejecting anything if it can't be defined. |
| 16061 | If some facts 'logically supervene' on some others, they just redescribe them, adding nothing [Lynch/Glasgow] |
| Full Idea: Logical supervenience, restricted to individuals, seems to imply strong reduction. It is said that where the B-facts logically supervene on the A-facts, the B-facts simply re-describe what the A-facts describe, and the B-facts come along 'for free'. | |
| From: Lynch,MP/Glasgow,JM (The Impossibility of Superdupervenience [2003], C) | |
| A reaction: This seems to be taking 'logically' to mean 'analytically'. Presumably an entailment is logically supervenient on its premisses, and may therefore be very revealing, even if some people think such things are analytic. |
| 16060 | Nonreductive materialism says upper 'levels' depend on lower, but don't 'reduce' [Lynch/Glasgow] |
| Full Idea: The root intuition behind nonreductive materialism is that reality is composed of ontologically distinct layers or levels. …The upper levels depend on the physical without reducing to it. | |
| From: Lynch,MP/Glasgow,JM (The Impossibility of Superdupervenience [2003], B) | |
| A reaction: A nice clear statement of a view which I take to be false. This relationship is the sort of thing that drives people fishing for an account of it to use the word 'supervenience', which just says two things seem to hang out together. Fluffy materialism. |
| 16064 | The hallmark of physicalism is that each causal power has a base causal power under it [Lynch/Glasgow] |
| Full Idea: Jessica Wilson (1999) says what makes physicalist accounts different from emergentism etc. is that each individual causal power associated with a supervenient property is numerically identical with a causal power associated with its base property. | |
| From: Lynch,MP/Glasgow,JM (The Impossibility of Superdupervenience [2003], n 11) | |
| A reaction: Hence the key thought in so-called (serious, rather than self-evident) 'emergentism' is so-called 'downward causation', which I take to be an idle daydream. |
| 21598 | Austin revealed many meanings for 'vague': rough, ambiguous, general, incomplete... [Austin,JL, by Williamson] |
| Full Idea: Austin's account brought out the variety of features covered by 'vague' in different contexts: roughness, ambiguity, imprecision, lack of detail, generality, inaccuracy, incompleteness. Even 'vague' is vague. | |
| From: report of J.L. Austin (Sense and Sensibilia [1962], p.125-8) by Timothy Williamson - Vagueness 3.1 | |
| A reaction: Some of these sound the same. Maybe Austin distinguishes them. |
| 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) |