Completeness of resolution revisited

DOI10.1016/0304-3975(90)90139-9zbMath0701.68085OpenAlexW1976151269MaRDI QIDQ914411

Marc Bezem

Publication date: 1990

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/2377

zbMATH Keywords

completenessresolutionZorn's lemmatransfinite inductionZermelo's well ordering theorem

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35)

Related Items (1)

Meta-resolution: An algorithmic formalisation

Cites Work

• A Machine-Oriented Logic Based on the Resolution Principle
• Automatic Theorem Proving With Renamable and Semantic Resolution
• Theorem-Proving for Computers: Some Results on Resolution and Renaming
• A Computing Procedure for Quantification Theory
• The axiom of choice
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Completeness of resolution revisited