Robbins algebra : conditions that make a near-Boolean algebra Boolean.
Some problems posed years ago remain challenging today. In particular, the Robbins problem, which is still open and which is the focus of attention in this paper, offers interesting challenges for attack with the assistance of an automated reasoning program; for the study presented here, we used the program OTTER. For example, when one submits this problem, which asks for a proof that every Robbins algebra is a Boolean algebra, a large number of deduced clauses results. One must, therefore, consider the possibility that there exists a Robbins algebra that is not Boolean; such an algebra would have to be infinite. One can instead search for properties that, if adjoined to those of a Robbins algebra, guarantee that the algebra is Boolean. Here we present a number of such properties, and we show how an automated reasoning program was used to obtain the corresponding proofs. Additional properties have been identified, and we include here examples of using such a program to check that the corresponding hand-proofs are correct. We present the appropriate input for many of the examples and also include the resulting proofs in clause notation.
- Research Organization:
- Argonne National Lab. (ANL), Argonne, IL (United States)
- Sponsoring Organization:
- ER
- DOE Contract Number:
- DE-AC02-06CH11357
- OSTI ID:
- 937613
- Report Number(s):
- ANL/MCS/JA-1841; JAREEW; TRN: US200905%%341
- Journal Information:
- J. Automat. Reason., Vol. 6, Issue 4 ; 1990; ISSN 0168-7433
- Country of Publication:
- United States
- Language:
- ENGLISH
Similar Records
Automated reasoning contributes to mathematics and logic
Automating the search for elegant proofs.