![]()
![]()
PHIL 250: Introduction to Symbolic Logic
tennant.9@osu.edu
CLASSICAL RULE OF DOUBLE-NEGATION ELIMINATION
A
_______
A Explanation in words: From the of any sentence A one may infer the sentence A itself. One thereby rests that conclusion A on the same set of assumptions on which its double negation depends.
Since this is neither an introduction rule, nor a genuine elimination rule (dealing with a single dominant occurrence of the operator concerned), there is no rule 'corresponding' to it! The rule of double-negation elimination obliterates any distinction between a sentence and its double negation.
[¬I] [∧I] [∨I] [→I] [∀I] [∃I]
[¬E] [∧E] [∨E] [→E] [∀E] [∃E]
[EFQ]
[LEM] [Dil] [CR] [DNE]