This paper discusses the use of saturation procedure in order to check looping sequents in reflexive common knowledge logic. Traditional approach states that common knowledge operator is defined by some induction-like axiom and requires the use of some looping sequents. The loopcheck-free saturation-like procedure lets us obtain special loopfree sequents.
This work is licensed under a Creative Commons Attribution 4.0 International License.
Please read the Copyright Notice in Journal Policy.