Conservative reduction classes of Krom formulas

DOI10.2307/2273385MaRDI QIDQ3947642zbMATH OpenOpenAlexFDO

Authors Stål Aanderaa, Egon Börger, 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

finite satisfiabilityprenex conjuctive normal formpure quantification theorysatisfiabilityunsolvable decision problem

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3657754 (Why is no real title available?)
• scientific article; zbMATH DE number 3715502 (Why is no real title available?)
• scientific article; zbMATH DE number 3310089 (Why is no real title available?)
• The Decision Problem for a Class of First‐Order Formulas in Which all Disjunctions are Binary
• The decision problem for formulas with a small number of atomic subformulas

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3947642)