Unification in Boolean rings

DOI10.1007/BF00297246zbMath0659.68111OpenAlexW2052429743WikidataQ55393330 ScholiaQ55393330MaRDI QIDQ1112626

Tobias Nipkow, Ursula Martin Webb

Publication date: 1988

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

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

zbMATH Keywords

Boolean algebraBoolean ringsunificationstring equations

Mathematics Subject Classification ID

Logical aspects of Boolean algebras (03G05) Ring-theoretic properties of Boolean algebras (06E20)

Related Items

On the complexity of Boolean unification, Introduction to ``Milestones in interactive theorem proving, Boolean unification - the story so far, Unification algorithms cannot be combined in polynomial time., Hybrid terms and sentences, Unification in free distributive lattices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Refutational theorem proving using term-rewriting systems
• Embedding Boolean expressions into logic programming
• The Knuth-Bendix Completion Procedure and Thue Systems
• Computer-Implemented Set Theory
• New Classes for Parallel Complexity: A Study of Unification and Other Complete Problems for P
• A Machine-Oriented Logic Based on the Resolution Principle