排序方式: 共有2条查询结果,搜索用时 15 毫秒
1
1.
Double-Negation Elimination in Some Propositional Logics 总被引:1,自引:0,他引:1
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 formn(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. 相似文献
2.
This article features long-sought proofs with intriguing properties (such as the absence of double negation and the avoidance of lemmas that appeared to be indispensable), and it features the automated methods for finding them. The theorems of concern are taken from various areas of logic that include two-valued sentential (or propositional) calculus and infinite-valued sentential calculus. Many of the proofs (in effect) answer questions that had remained open for decades, questions focusing on axiomatic proofs. The approaches we take are of added interest in that all rely heavily on the use of a single program that offers logical reasoning, William McCune's automated reasoning program OTTER. The nature of the successes and approaches suggests that this program offers researchers a valuable automated assistant. This article has three main components. First, in view of the interdisciplinary nature of the audience, we discuss the means for using the program in question (OTTER), which flags, parameters, and lists have which effects, and how the proofs it finds are easily read. Second, because of the variety of proofs that we have found and their significance, we discuss them in a manner that permits comparison with the literature. Among those proofs, we offer a proof shorter than that given by Meredith and Prior in their treatment of ukasiewicz's shortest single axiom for the implicational fragment of two-valued sentential calculus, and we offer a proof for the ukasiewicz 23-letter single axiom for the full calculus. Third, with the intent of producing a fruitful dialogue, we pose questions concerning the properties of proofs and, even more pressing, invite questions similar to those this article answers. 相似文献
1