Proving implications by algebraic approximation

DOI10.1016/0304-3975(96)00040-0zbMATH Open0872.68070OpenAlexW1517292757MaRDI QIDQ671502FDOQ671502

Michael Codish, Grigory Mashevitzky

Publication date: 27 February 1997

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

Full work available at URL: https://doi.org/10.1016/0304-3975(96)00040-0

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cites Work

• Title not available (Why is that?)
• Graph-Based Algorithms for Boolean Function Manipulation
• Galois Connexions
• The Laws of Finite Pointed Groups
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The metamathematics of algebraic systems. Collected papers: 1936-1967. Translated, edited, and provided with supplementary notes by Benjamin Franklin Wells III
• Analyzing logic programs using “prop”-ositional logic programs and a magic wand
• Title not available (Why is that?)
• Subdirect unions in universal algebra
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (2)

• Implicit proofs
• Title not available (Why is that?)

   Recommendations

• Title not available (Why is that?) 👍 👎
• A new algebraic tool for automatic theorem provers. Multisemilattice: A structure to improve the efficiency of provers in temporal logics 👍 👎
• Proper implication lattices and well implication lattices. 👍 👎
• Title not available (Why is that?) 👍 👎
• Algebraic functions in Łukasiewicz implication algebras. 👍 👎

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 Q671502)