The decision problem for formulas in prenex conjunctive normal form with binary disjunctions

DOI10.2307/2270511zbMath0207.01301OpenAlexW2002672992MaRDI QIDQ5607225

Melven R. Krom

Publication date: 1970

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

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

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25)

Related Items (6)

On propositional definability ⋮ Unnamed Item ⋮ Disjunctive closures for knowledge compilation ⋮ Beitrag zur Reduktion des Entscheidungsproblems auf Klassen von Hornformeln mit kurzen Alternationen ⋮ Resolution and model building in the infinite-valued calculus of Łukasiewicz ⋮ On biconjunctive reduction classes

Cites Work

• Tag systems and lag systems
• A property of sentences that define quasi-order
• Introduction to model theory and to the metamathematics of algebra
• Universality of Tag Systems with P = 2
• The Decision Problem for a Class of First‐Order Formulas in Which all Disjunctions are Binary
• The Decision Problem for Segregated Formulas in First-Order Logic.

This page was built for publication: The decision problem for formulas in prenex conjunctive normal form with binary disjunctions