more from this thinker     |     more from this text


Single Idea 17926

[filed under theme 4. Formal Logic / E. Nonclassical Logics / 2. Intuitionist Logic ]

Full Idea

The intuitionist rejection of double negation elimination undermines the important reductio ad absurdum proof in classical mathematics.

Gist of Idea

Rejecting double negation elimination undermines reductio proofs

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.8

Related Idea

Idea 17925 Showing a disproof is impossible is not a proof, so don't eliminate double negation [Colyvan]


The 15 ideas with the same theme [logic which uses 'provable' in place of 'true']:

Mathematical statements and entities that result from an infinite process must lack a truth-value [Dummett]
Dummett says classical logic rests on meaning as truth, while intuitionist logic rests on assertability [Dummett, by Kitcher]
Classical interdefinitions of logical constants and quantifiers is impossible in intuitionism [Bostock]
Intuitionists rely on assertability instead of truth, but assertability relies on truth [Kitcher]
Is classical logic a part of intuitionist logic, or vice versa? [Burgess]
It is still unsettled whether standard intuitionist logic is complete [Burgess]
You can employ intuitionist logic without intuitionism about mathematics [Sider]
Intuitionist logic looks best as natural deduction [Mares]
Intuitionism as natural deduction has no rule for negation [Mares]
(∀x)(A v B) |- (∀x)A v (∃x)B) is valid in classical logic but invalid intuitionistically [Beall/Restall]
Double negation elimination is not valid in intuitionist logic [Friend]
Showing a disproof is impossible is not a proof, so don't eliminate double negation [Colyvan]
Rejecting double negation elimination undermines reductio proofs [Colyvan]
It is the second-order part of intuitionistic logic which actually negates some classical theorems [Rumfitt]
Intuitionists can accept Double Negation Elimination for decidable propositions [Rumfitt]