Double-Negation Elimination in Some Propositional Logics

Details Double-Negation Elimination in Some Propositional Logics Double-Negation Elimination in Some Propositional Logics

2003-01-24

arxiv.org/abs/cs/0301026v1

Computer Science

Logic in Computer Science

32 pages, no figures

Scientific paper

This article answers two questions (posed in the literature), each concerning the guaranteed existence of proofs free of double negation. A proof is free of double negation if none of its deduced steps contains a term of the form n(n(t)) for some term t, where n denotes negation. The first question asks for conditions on the hypotheses that, if satisfied, guarantee the existence of a double-negation-free proof when the conclusion is free of double negation. The second question asks about the existence of an axiom system for classical propositional calculus whose use, for theorems with a conclusion free of double negation, guarantees the existence of a double-negation-free proof. After giving conditions that answer the first question, we answer the second question by focusing on the Lukasiewicz three-axiom system. We then extend our studies to infinite-valued sentential calculus and to intuitionistic logic and generalize the notion of being double-negation free. The double-negation proofs of interest rely exclusively on the inference rule condensed detachment, a rule that combines modus ponens with an appropriately general rule of substitution. The automated reasoning program OTTER played an indispensable role in this study.

Affiliated with

Also associated with

No associations

Rating

Double-Negation Elimination in Some Propositional Logics does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Double-Negation Elimination in Some Propositional Logics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Double-Negation Elimination in Some Propositional Logics will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-715385