An abstract form of modus ponens in a Boolean algebra was suggested in [1]. In this paper we use the general theory of Boolean equations (see e.g. [2]) to obtain a further generalization. For a similar research on Boolean deduction theorems see [3].
@article{urn:eudml:doc:39118,
title = {On Boolean modus ponens.},
journal = {Mathware and Soft Computing},
volume = {5},
year = {1998},
pages = {115-119},
zbl = {0931.03075},
mrnumber = {MR1632775},
language = {en},
url = {http://dml.mathdoc.fr/item/urn:eudml:doc:39118}
}
Rudeanu, Sergiu. On Boolean modus ponens.. Mathware and Soft Computing, Tome 5 (1998) pp. 115-119. http://gdmltest.u-ga.fr/item/urn:eudml:doc:39118/