scientific article; zbMATH DE number 7533344
From MaRDI portal
Publication:5079743
DOI10.4230/LIPIcs.CSL.2018.19MaRDI QIDQ5079743
Publication date: 28 May 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (9)
Complexity of a fragment of infinitary action logic with exponential via non-well-founded proofs ⋮ Uniform interpolation from cyclic proofs: the case of modal mu-calculus ⋮ A restricted fragment of the Lambek calculus with iteration and intersection operations ⋮ Kleene star, subexponentials without contraction, and infinite computations ⋮ Unnamed Item ⋮ Contributed papers. Restriction on cut in cyclic proof system for symbolic heaps ⋮ Non-well-founded deduction for induction and coinduction ⋮ NON-WELL-FOUNDED PROOFS FOR THE GRZEGORCZYK MODAL LOGIC ⋮ Integrating induction and coinduction via closure operators and proof cycles
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear logic
- Residuated lattices. An algebraic glimpse at substructural logics
- Complete systems of \(\mathcal B\)-rational identities
- A completeness theorem for Kleene algebras and the algebra of regular events
- A calculational approach to mathematical induction
- A cut-free cyclic proof system for Kleene algebra
- From semirings to residuated Kleene lattices
- Proof Pearl: regular expression equivalence and relation algebra
- Concurrent Kleene Algebra
- The Mathematics of Sentence Structure
- On Action Logic: Equational Theories of Action Algebras
- Least and Greatest Fixpoints in Game Semantics
- Logic Programming with Focusing Proofs in Linear Logic
- Une condition impliquant toutes les identités rationnelles
- Kleene Algebra with Tests and Coq Tools for while Programs
- NetKAT
- Regular expression containment
- Automata, Languages and Programming
- On Hoare logic and Kleene algebra with tests
- An Efficient Coq Tactic for Deciding Kleene Algebras
This page was built for publication: