Problem corner: Robbins algebra: Conditions that make a near-Boolean algebra Boolean

DOI10.1007/BF00244359zbMath0714.68097OpenAlexW1999990752MaRDI QIDQ751313

D. Kharzeev

Publication date: 1990

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

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

zbMATH Keywords

Boolean algebraautomated reasoninguniversal algebraautomated theorem provingRobbins algebra

Mathematics Subject Classification ID

Related Items

The resonance strategy, Using hints to increase the effectiveness of an automated reasoning program: Case studies, Goals and benchmarks for automated map reasoning, Problems on the generation of finite models, The Clause-Diffusion theorem prover Peers-mcd (system description), Automated proofs of equality problems in Overbeek's competition

Uses Software

• OTTER