The ground-negative fragment of first-order logic is -complete

DOI10.2307/2586615zbMath0941.03039OpenAlexW2016284852MaRDI QIDQ4934025

Andrei Voronkov

Publication date: 31 July 2000

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

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

zbMATH Keywords

satisfiability problemvalidity problemground-negative formulasground-positive formulas

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Subsystems of classical logic (including intuitionistic logic) (03B20)

Cites Work

• Unnamed Item
• Positive First-Order Logic Is NP-Complete
• Decision procedures and model building in equational clause logic
• Hyperresolution and automated model building

This page was built for publication: The ground-negative fragment of first-order logic is -complete