The Decision Problem for a Class of First‐Order Formulas in Which all Disjunctions are Binary
From MaRDI portal
Publication:5545955
DOI10.1002/malq.19670130104zbMath0162.31601WikidataQ55966490 ScholiaQ55966490MaRDI QIDQ5545955
Publication date: 1967
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.19670130104
Related Items
Beitrag zur Reduktion des Entscheidungsproblems auf Klassen von Hornformeln mit kurzen Alternationen, The decision problem for formulas in prenex conjunctive normal form with binary disjunctions, Capturing complexity classes by fragments of second-order logic, Complete rings of sets and sentential logic, The computational complexity of propositional STRIPS planning, Conservative reduction classes of Krom formulas, Prefix classes of Krom formulas