A reduction class containing formulas with one monadic predicate and one binary function symbol

Journal of Symbolic Logic 41 (1):45-49 (1976)
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
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2272944
Options
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 31,856
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
Added to PP index
2009-01-28

Total downloads
9 ( #519,427 of 2,231,724 )

Recent downloads (6 months)
1 ( #446,071 of 2,231,724 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature