display all the ideas for this combination of texts
4 ideas
| 8709 | The law of excluded middle is syntactic; it just says A or not-A, not whether they are true or false [Friend] |
| Full Idea: The law of excluded middle is purely syntactic: it says for any well-formed formula A, either A or not-A. It is not a semantic law; it does not say that either A is true or A is false. The semantic version (true or false) is the law of bivalence. | |
| From: Michèle Friend (Introducing the Philosophy of Mathematics [2007], 5.2) | |
| A reaction: No wonder these two are confusing, sufficiently so for a lot of professional philosophers to blur the distinction. Presumably the 'or' is exclusive. So A-and-not-A is a contradiction; but how do you explain a contradiction without mentioning truth? |
| 8711 | Intuitionists read the universal quantifier as "we have a procedure for checking every..." [Friend] |
| Full Idea: In the intuitionist version of quantification, the universal quantifier (normally read as "all") is understood as "we have a procedure for checking every" or "we have checked every". | |
| From: Michèle Friend (Introducing the Philosophy of Mathematics [2007], 5.5) | |
| A reaction: It seems better to describe this as 'verificationist' (or, as Dummett prefers, 'justificationist'). Intuition suggests an ability to 'see' beyond the evidence. It strikes me as bizarre to say that you can't discuss things you can't check. |
| 8675 | Paradoxes can be solved by talking more loosely of 'classes' instead of 'sets' [Friend] |
| Full Idea: The realist meets the Burali-Forti paradox by saying that all the ordinals are a 'class', not a set. A proper class is what we discuss when we say "all" the so-and-sos when they cannot be reached by normal set-construction. Grammar is their only limit. | |
| From: Michèle Friend (Introducing the Philosophy of Mathematics [2007], 2.3) | |
| A reaction: This strategy would be useful for Class Nominalism, which tries to define properties in terms of classes, but gets tangled in paradoxes. But why bother with strict sets if easy-going classes will do just as well? Descartes's Dream: everything is rational. |
| 8674 | The Burali-Forti paradox asks whether the set of all ordinals is itself an ordinal [Friend] |
| Full Idea: The Burali-Forti paradox says that if ordinals are defined by 'gathering' all their predecessors with the empty set, then is the set of all ordinals an ordinal? It is created the same way, so it should be a further member of this 'complete' set! | |
| From: Michèle Friend (Introducing the Philosophy of Mathematics [2007], 2.3) | |
| A reaction: This is an example (along with Russell's more famous paradox) of the problems that began to appear in set theory in the early twentieth century. See Idea 8675 for a modern solution. |