Kleene star, subexponentials without contraction, and infinite computations
From MaRDI portal
Publication:2234420
DOI10.33048/semi.2021.18.069OpenAlexW3199007782MaRDI QIDQ2234420
Publication date: 19 October 2021
Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.33048/semi.2021.18.069
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Product-free Lambek calculus is NP-complete
- Algebras for iteration and infinite computations
- Subexponential concurrent constraint programming
- Infinitary action logic: complexity, models and grammars
- Unidirectional Lambek grammars in polynomial time
- Decision problems for propositional linear logic
- The Lambek calculus enriched with additional connectives
- A completeness theorem for Kleene algebras and the algebra of regular events
- A decade of concurrency. Reflections and perspectives. REX School/ Symposium, Noordwijkerhout, the Netherlands, June 1-4, 1993. Proceedings
- A logical framework with commutative and non-commutative subexponentials
- PSPACE-completeness of a thread criterion for circular proofs in linear logic with least and greatest fixed points
- Non-terminating processes in the situation calculus
- Logic, language, and security. Essays dedicated to Andre Scedrov on the occasion of his 65th birthday.
- Lambek calculus is NP-complete
- On the complexity of reasoning in Kleene algebra
- A General Proof System for Modalities in Concurrent Constraint Programming
- On Action Logic: Equational Theories of Action Algebras
- Product-free Lambek calculus and context-free grammars
- Subexponentials in non-commutative linear logic
- Types for Proofs and Programs
- Least and Greatest Fixed Points in Linear Logic
This page was built for publication: Kleene star, subexponentials without contraction, and infinite computations
