Prefix classes of Krom formulas

DOI10.2307/2271987zbMath0326.02035OpenAlexW2162764642MaRDI QIDQ4090321

Stål Aanderaa, Harry R. Lewis

Publication date: 1974

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

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

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Turing machines and related notions (03D10)

Related Items (2)

The complexity of the satisfiability problem for Krom formulas ⋮ Prefix classes of krom formulae with identity

Cites Work

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

This page was built for publication: Prefix classes of Krom formulas