more on this theme     |     more from this thinker


Single Idea 17924

[filed under theme 5. Theory of Logic / D. Assumptions for Logic / 2. Excluded Middle ]

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.

Gist of Idea

Excluded middle says P or not-P; bivalence says P is either true or false

Source

Mark Colyvan (Introduction to the Philosophy of Mathematics [2012], 1.1.3)

Book Ref

Colyvan,Mark: 'An Introduction to the Philosophy of Mathematics' [CUP 2012], p.7


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.

Related Ideas

Idea 9024 Excluded middle has three different definitions [Quine]

Idea 8709 The law of excluded middle is syntactic; it just says A or not-A, not whether they are true or false [Friend]

Idea 18919 There are no 'falsifying' facts, only an absence of truthmakers [Engelbretsen]


The 21 ideas from 'Introduction to the Philosophy of Mathematics'

Reducing real numbers to rationals suggested arithmetic as the foundation of maths [Colyvan]
Intuitionists only accept a few safe infinities [Colyvan]
Showing a disproof is impossible is not a proof, so don't eliminate double negation [Colyvan]
Rejecting double negation elimination undermines reductio proofs [Colyvan]
Excluded middle says P or not-P; bivalence says P is either true or false [Colyvan]
Ordinal numbers represent order relations [Colyvan]
Löwenheim proved his result for a first-order sentence, and Skolem generalised it [Colyvan]
Axioms are 'categorical' if all of their models are isomorphic [Colyvan]
Structuralism say only 'up to isomorphism' matters because that is all there is to it [Colyvan]
If 'in re' structures relies on the world, does the world contain rich enough structures? [Colyvan]
Proof by cases (by 'exhaustion') is said to be unexplanatory [Colyvan]
Reductio proofs do not seem to be very explanatory [Colyvan]
If inductive proofs hold because of the structure of natural numbers, they may explain theorems [Colyvan]
Transfinite induction moves from all cases, up to the limit ordinal [Colyvan]
Mathematical generalisation is by extending a system, or by abstracting away from it [Colyvan]
Mathematics can show why some surprising events have to occur [Colyvan]
Mathematics can reveal structural similarities in diverse systems [Colyvan]
Most mathematical proofs are using set theory, but without saying so [Colyvan]
Infinitesimals were sometimes zero, and sometimes close to zero [Colyvan]
Can a proof that no one understands (of the four-colour theorem) really be a proof? [Colyvan]
Probability supports Bayesianism better as degrees of belief than as ratios of frequencies [Colyvan]