Conservative reduction classes of Krom formulas

Journal of Symbolic Logic 47 (1):110-130 (1982)
Abstract
A Krom formula of pure quantification theory is a formula in conjunctive normal form such that each conjunct is a disjunction of at most two atomic formulas or negations of atomic formulas. Every class of Krom formulas that is determined by the form of their quantifier prefixes and which is known to have an unsolvable decision problem for satisfiability is here shown to be a conservative reduction class. Therefore both the general satisfiability problem, and the problem of satisfiability in finite models, can be effectively reduced from arbitrary formulas to Krom formulas of these several prefix types
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2273385
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 23,316
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA
M. R. Krom (1967). The Decision Problem for a Class of First-Order Formulas in Which All Disjunctions Are Binary. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 13 (1-2):15-20.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Monthly downloads

Added to index

2009-01-28

Total downloads

22 ( #212,892 of 1,932,586 )

Recent downloads (6 months)

6 ( #149,516 of 1,932,586 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Start a new thread
Order:
There  are no threads in this forum
Nothing in this forum yet.