True Concurrency of Deep Inference Proofs
From MaRDI portal
Publication:2820698
DOI10.1007/978-3-662-52921-8_16zbMath1478.03079OpenAlexW2501878985MaRDI QIDQ2820698
Publication date: 9 September 2016
Published in: Logic, Language, Information, and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-52921-8_16
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42) Structure of proofs (03F07) Proof-theoretic aspects of linear logic and other substructural logics (03F52)
Uses Software
Cites Work
- Unnamed Item
- Forum: A multiple-conclusion specification logic
- Models for concurrency: Towards a classification
- On linear logic planning and concurrency
- System BV is NP-complete
- On the proof complexity of deep inference
- Normalisation Control in Deep Inference via Atomic Flows
- A system of interaction and structure
- A Proof Calculus Which Reduces Syntactic Bureaucracy
- Maude as a Platform for Designing and Implementing Deep Inference Systems
This page was built for publication: True Concurrency of Deep Inference Proofs