Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-17T14:21:46.530Z Has data issue: false hasContentIssue false

On simplifying the matrix of a wff

Published online by Cambridge University Press:  12 March 2014

Peter Andrews*
Affiliation:
Carnegie-Mellon University

Extract

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.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1968

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable