No CrossRef data available.
Article contents
A reduction class containing formulas with one monadic predicate and one binary function symbol
Published online by Cambridge University Press: 12 March 2014
Abstract
A new reduction class is presented for the satisfiability problem for well-formed formulas of the first-order predicate calculus. The members of this class are closed prenex formulas of the form ∀x∀yC. The matrix C is in conjunctive normal form and has no disjuncts with more than three literals, in fact all but one conjunct is unary. Furthermore C contains but one predicate symbol, that being unary, and one function symbol which symbol is binary.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 1976