Abstract

The equational properties of the least fixed point operation on (ω-)continuous functions on (ω-)complete partially ordered sets are captured by the axioms of iteration algebras, or iteration theories. We show that the equational laws of the binary supremum operation in conjunction with the least fixed point operation on (ω-)continuous functions on (ω -)complete semilattices have a finite axiomatization over the equations of iteration algebras. As a byproduct of this relative axiomatizability result, we obtain complete infinite equational, and finite implicational axiomatizations.KeywordsEquational TheoryPoint OperationFree AlgebraRegular TreeProcess AlgebraThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.