A unification of ordering refinements of resolution in classical logic

DOI10.1007/BFB0021974MaRDI QIDQ4537439zbMATH OpenFDO

Authors Hans de Nivelle

Publication date 30 June 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0021974

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35)

Recommendations

• On the unification of classical, intuitionistic and affine logics
• An ordered theory resolution calculus
• Labelled resolution for classical and non-classical logics
• A hierarchy of classical and paraconsistent logics
• scientific article; zbMATH DE number 1795986
• On resolution in fragments of classical linear logic
• scientific article; zbMATH DE number 4027425
• Resolution with order and selection for hybrid logics
• Logics for residuated pseudo-uninorms and their residua
• scientific article; zbMATH DE number 517007

Cited in

(7)

• Completeness results for inequality provers
• A-ordered tableaux
• An ordered theory resolution calculus
• scientific article; zbMATH DE number 517062 (Why is no real title available?)
• Completeness for linear regular negation normal form inference systems
• scientific article; zbMATH DE number 2079034 (Why is no real title available?)
• Semantic tableaux with ordering restrictions

This page was built for publication: A unification of ordering refinements of resolution in classical logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4537439)