Abstract
In [3], [4], and [5] Joyce Friedman formulated and investigated certain rules which constitute a semi-decision procedure for wffs of first order predicate calculus in closed prenex normal form with prefixes of the form ∀x1 … ∀xκ∃y1 … ∃ym∀z1 … ∀zn. Given such a wff QM, where Q is the prefix and M is the matrix in conjunctive normal form, Friedman's rules can be used, in effect, to construct a matrix M* which is obtained from M by deleting certain conjuncts of M.
Publisher
Cambridge University Press (CUP)
Reference9 articles.
1. Logic of many-sorted theories;Wang;this Journal,1952
2. A proof procedure for quantification theory;Quine;this Journal,1955
3. A Machine-Oriented Logic Based on the Resolution Principle
4. Completeness in the theory of types;Henkin;this Journal,1950
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Automatic Theorem Proving Based on Resolution;International Tracts in Computer Science and Technology and Their Application;1974
2. A brief review and bibliography of investigations into automation of search of theorem proofs in formal theories;Cybernetics;1974
3. Bibliography;Symbolic Logic and Mechanical Theorem Proving;1973
4. Automatic theorem proving based on resolution;Annual Review in Automatic Programming;1973-01
5. An Overview of Mechanical Theorem Proving;Theoretical Approaches to Non-Numerical Problem Solving;1970