@INPROCEEDINGS{SchmidtOrlowskaHustadt04a,
AUTHOR = {Schmidt, R. A. and Orlowska, E. and Hustadt, U.},
YEAR = {2004},
TITLE = {Two Proof Systems for {P}eirce Algebras},
EDITOR = {Berghammer, R. and M{\"o}ller, B. and Struth, G.},
BOOKTITLE = {Relational and {K}leene-Algebraic Methods in Computer Science (RelMiCS 7)},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {3051},
PUBLISHER = {Springer},
PAGES = {238--251},
URL = {\url{http://www.cs.man.ac.uk/~schmidt/publications/SchmidtOrlowskaHustadt04a.html}},
ABSTRACT = {
This paper develops and compares two tableaux-style proof systems for
Peirce algebras.
One is a tableau refutation proof system, the other is a proof system in
the style of Rasiowa-Sikorski.
}
}