Proving implications by algebraic approximation

DOI10.1007/3-540-58431-5_4MaRDI QIDQ4537504zbMATH OpenFDO

Authors Michael Codish, Grigory Mashevitzky

Publication date 1 July 2002

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

Full work available at URL https://doi.org/10.1007/3-540-58431-5_4

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Semilattices (06A12) Lattices (06B99) Semantics in the theory of computing (68Q55)

Recommendations

• Proving implications by algebraic approximation
• A new algebraic tool for automatic theorem provers. Multisemilattice: A structure to improve the efficiency of provers in temporal logics
• scientific article; zbMATH DE number 2116933
• Proper implication lattices and well implication lattices.
• scientific article; zbMATH DE number 2067135

Cited in

(3)

• Implicit proofs
• Proving implications by algebraic approximation
• A new algebraic tool for automatic theorem provers. Multisemilattice: A structure to improve the efficiency of provers in temporal logics

This page was built for publication: Proving implications by algebraic approximation

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