Canonicity!

DOI10.1007/978-3-540-71070-7_29zbMath1165.03311OpenAlexW4244250018MaRDI QIDQ3541714

Nachum Dershowitz

Publication date: 27 November 2008

Published in: Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-71070-7_29

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35)

Related Items (1)

Regaining cut admissibility in deduction modulo using abstract completion

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Towards a foundation of completion procedures as semidecision procedures
• A complete proof of correctness of the Knuth-Bendix completion algorithm
• Regaining cut admissibility in deduction modulo using abstract completion
• Abstract canonical presentations
• Canonical Inference for Implicational Systems
• An algorithm for finding canonical sets of ground rewrite rules in polynomial time
• Equational inference, canonical proofs, and proof orderings
• Canonical Ground Horn Theories
• Canonicity1 1This research was supported in part by the Israel Science Foundation (grant no. 254/01).
• Abstract canonical inference
• Cut Elimination in Deduction Modulo by Abstract Completion
• Completion Is an Instance of Abstract Canonical System Inference

This page was built for publication: Canonicity!