References

  1. Frank Drewes, Hans-Jörg Kreowski & Annegret Habel (1997): Hyperedge Replacement Graph Grammars. In: Grzegorz Rozenberg: Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations. World Scientific, pp. 95–162, doi:10.1142/9789812384720_0002.
  2. Hartmut Ehrig, Michael Pfender & Hans Jürgen Schneider (1973): Graph-Grammars: An Algebraic Approach. In: 14th Annual Symposium on Switching and Automata Theory, Iowa City, Iowa, USA, October 15-17, 1973. IEEE Computer Society, pp. 167–180, doi:10.1109/SWAT.1973.11.
  3. Makoto Kanazawa (1992): The Lambek calculus enriched with additional connectives. J. Log. Lang. Inf. 1(2), pp. 141–171, doi:10.1007/BF00171695.
  4. Makoto Kanazawa (1999): Lambek Calculus: Recognizing Power and Complexity. In: Jelle Gerbrandy, Maarten Marx, Maarten de Rijke & Yde Venema: Essays Dedicated to Johan van Benthem on the Occasion of His 50th Birthday. Amsterdam University Press.
  5. Max I. Kanovich, Stepan L. Kuznetsov, Vivek Nigam & Andre Scedrov (2020): Soft Subexponentials and Multiplexing. In: IJCAR (1), Lecture Notes in Computer Science 12166. Springer, pp. 500–517, doi:10.1007/978-3-030-51074-9_29.
  6. Barbara König, Dennis Nolte, Julia Padberg & Arend Rensink (2018): A Tutorial on Graph Transformation. In: Reiko Heckel & Gabriele Taentzer: Graph Transformation, Specifications, and Nets - In Memory of Hartmut Ehrig, Lecture Notes in Computer Science 10800. Springer, pp. 83–104, doi:10.1007/978-3-319-75396-6_5.
  7. Stepan L. Kuznetsov (2021): Complexity of the Infinitary Lambek Calculus with Kleene Star. Rev. Symb. Log. 14(4), pp. 946–972, doi:10.1017/S1755020320000209.
  8. Joachim Lambek (1958): The Mathematics of Sentence Structure. The American Mathematical Monthly 65(3), pp. 154–170, doi:10.1080/00029890.1958.11989160.
  9. Patrick Lincoln, John C. Mitchell, Andre Scedrov & Natarajan Shankar (1992): Decision Problems for Propositional Linear Logic. Ann. Pure Appl. Log. 56(1-3), pp. 239–311, doi:10.1016/0168-0072(92)90075-B.
  10. Franco Montagna (2004): Storage Operators and Multiplicative Quantifiers in Many-valued Logics. J. Log. Comput. 14(2), pp. 299–322, doi:10.1093/logcom/14.2.299.
  11. Richard Moot & Mario Piazza (2001): Linguistic Applications of First Order Intuitionistic Linear Logic. J. Log. Lang. Inf. 10(2), pp. 211–232, doi:10.1023/A:1008399708659.
  12. Ewa Palka (2007): An Infinitary Sequent System for the Equational Theory of *-continuous Action Lattices. Fundam. Informaticae 78(2), pp. 295–309.
  13. Tikhon Pshenitsyn (2021): Grammars Based on a Logic of Hypergraph Languages. In: Berthold Hoffmann & Mark Minas: Proceedings Twelfth International Workshop on Graph Computational Models, GCM@STAF 2021, Online, 22nd June 2021, EPTCS 350, pp. 1–18, doi:10.4204/EPTCS.350.1.
  14. Tikhon Pshenitsyn (2022): Grammars over the Lambek Calculus with Permutation: Recognizing Power and Connection to Branching Vector Addition Systems with States, doi:10.48550/ARXIV.2209.08415. Available at https://arxiv.org/abs/2209.08415.
  15. Tikhon Pshenitsyn (2022): Hypergraph Lambek grammars. Journal of Logical and Algebraic Methods in Programming 129, pp. 100798, doi:10.1016/j.jlamp.2022.100798.

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