References

  1. Ajesh Babu & Paritosh K. Pandya (2012): Chop Expressions and Discrete Duration Calculus. In: Modern Applications of Automata Theory, pp. 229–256, doi:10.1142/9789814271059_0008.
  2. Stanley Burris & H. P. Sankappanavar (1981): A Course in Universal Algebra. Graduate Texts in Mathematics 78. Springer, doi:10.1007/978-1-4613-8130-3_7.
  3. Wojciech Buszkowski (2007): On Action Logic: Equational Theories of Action Algebras. J. Log. Comput. 17(1), pp. 199–217, doi:10.1093/logcom/exl036.
  4. John Horton Conway (1971): Regular algebra and finite machines. Chapman & Hall mathematics series. Chapman and Hall, London.
  5. Nikolaos Galatos, Peter Jipsen, Tomasz Kowalski & Hiroakira Ono (2007): Residuated Lattices: An Algebraic Glimpse at Substructural Logics. Elsevier.
  6. Antony Galton (1984): The Logic of Aspect : An axiomatic approach. Clarendon Press, Oxford.
  7. Jean-Yves Girard (1987): Linear Logic. Theoretical Computer Science 50, pp. 1–102, doi:10.1016/0304-3975(87)90045-4.
  8. Dag Hovland (2012): The inclusion problem for regular expressions. J. Comput. Syst. Sci. 78(6), pp. 1795–1813, doi:10.1016/j.jcss.2011.12.003.
  9. Dexter Kozen (1990): On Kleene Algebras and Closed Semirings. In: Branislav Rovan: MFCS, Lecture Notes in Computer Science 452. Springer, pp. 26–47, doi:10.1007/BFb0029594.
  10. Dexter Kozen (1991): A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events. In: LICS. IEEE Computer Society, pp. 214–225, doi:10.1109/LICS.1991.151646.
  11. Dexter Kozen & Jerzy Tiuryn (2003): Substructural logic and partial correctness. ACM Trans. Comput. Log. 4(3), pp. 355–378, doi:10.1145/772062.772066.
  12. Mark Moens & Mark Steedman (1988): Temporal ontology and temporal reference. Computational Linguistics 14, pp. 15–28.
  13. Vaughan R. Pratt (1990): Action Logic and Pure Induction. In: Jan van Eijck: JELIA, Lecture Notes in Computer Science 478. Springer, pp. 97–120, doi:10.1007/BFb0018436.
  14. Greg Restall (2008): An introduction to substructural logics. Routledge, New York [u.a.].

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org