Proof System for Relation Algebra

Abstract

Orlowska's proof system is a sound and complete proof system for homogeneous relation algebras. However, it is not suitable for efficient automatic verification. In this paper, we propose a new proof system which is suitable for implementation and show that it is sound and complete. Moreover, we give some counterexamples showing that termination and completeness of those systems are incompatible with each other.