Journal of Symbolic Logic

A Reduction Class Containing Formulas with one Monadic Predicate and one Binary Function Symbol

Charles E. Hughes

Full-text is available via JSTOR, for JSTOR subscribers. Go to this article in JSTOR.

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 $\forall x\forall 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.

Article information

Source
J. Symbolic Logic, Volume 41, Issue 1 (1976), 45-49.

Dates
First available in Project Euclid: 6 July 2007

Permanent link to this document
https://projecteuclid.org/euclid.jsl/1183739715

Mathematical Reviews number (MathSciNet)
MR416892

Zentralblatt MATH identifier
0332.02051

JSTOR
links.jstor.org

Citation

Hughes, Charles E. A Reduction Class Containing Formulas with one Monadic Predicate and one Binary Function Symbol. J. Symbolic Logic 41 (1976), no. 1, 45--49. https://projecteuclid.org/euclid.jsl/1183739715


Export citation