more from this thinker     |     more from this text


Single Idea 18799

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

Full Idea

Double Negation Elimination is a rule of inference which the classicist accepts without restriction, but which the intuitionist accepts only for decidable propositions.

Gist of Idea

Intuitionists can accept Double Negation Elimination for decidable propositions

Source

Ian Rumfitt (The Boundary Stones of Thought [2015], 1.1)

Book Ref

Rumfitt,Ian: 'The Boundary Stones of Thought' [OUP 2015], p.3


A Reaction

This cures me of my simplistic understanding that intuitionists just reject the rules about double negation.


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]