Conservative reduction classes of Krom formulas

DOI10.2307/2273385zbMath0487.03005OpenAlexW2099158350MaRDI QIDQ3947642

Egon Börger, Stål Aanderaa, Harry R. Lewis

Publication date: 1982

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2273385

zbMATH Keywords

satisfiabilityfinite satisfiabilityprenex conjuctive normal formpure quantification theoryunsolvable decision problem

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Classical first-order logic (03B10) Decidability of theories and sets of sentences (03B25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The decision problem for formulas with a small number of atomic subformulas
• The Decision Problem for a Class of First‐Order Formulas in Which all Disjunctions are Binary

This page was built for publication: Conservative reduction classes of Krom formulas