True concurrency of deep inference proofs

DOI10.1007/978-3-662-52921-8_16MaRDI QIDQ2820698zbMATH OpenOpenAlexFDO

Authors Ozan Kahramanoğulları

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

Mathematics Subject Classification ID

Structure of proofs (03F07) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Grammars and rewriting systems (68Q42) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Interaction and depth against nondeterminism in proof search
• On the proof complexity of deep inference
• An Algorithmic Interpretation of a Deep Inference System
• Maude as a platform for designing and implementing deep inference systems
• A System of Interaction and Structure II: The Need for Deep Inference

Cites work

• A proof calculus which reduces syntactic bureaucracy
• A system of interaction and structure
• Forum: A multiple-conclusion specification logic
• scientific article; zbMATH DE number 786485 (Why is no real title available?)
• Maude as a platform for designing and implementing deep inference systems
• Models for concurrency: Towards a classification
• Normalisation Control in Deep Inference via Atomic Flows
• On linear logic planning and concurrency
• On the proof complexity of deep inference
• System BV is NP-complete

Cited in

(3)

• On the proof complexity of deep inference
• Maude as a platform for designing and implementing deep inference systems
• Deep inference in proof search: the need for shallow inference

Describes a project that uses

Uses Software

• Maude

This page was built for publication: True concurrency of deep inference proofs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2820698)