Proving implications by algebraic approximation

DOI10.1016/0304-3975(96)00040-0zbMath0872.68070OpenAlexW1517292757MaRDI QIDQ671502

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

• 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
• Graph-Based Algorithms for Boolean Function Manipulation
• The Laws of Finite Pointed Groups
• Subdirect unions in universal algebra
• Galois Connexions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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