Normalisation Control in Deep Inference via Atomic Flows

DOI10.2168/LMCS-4(1:9)2008zbMath1142.03033arXiv0709.1205MaRDI QIDQ3518275

Alessio Guglielmi, Tom Gundersen

Publication date: 7 August 2008

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0709.1205

zbMATH Keywords

cut eliminationpropositional logicdeep inferencegeometric formalismnormalisation theorem

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Classical propositional logic (03B05)

Related Items (17)

On the Power of Substitution in the Calculus of Structures ⋮ Combinatorial flows as bicolored atomic flows ⋮ Enumerating Independent Linear Inferences ⋮ Classical proof forestry ⋮ On linear rewriting systems for Boolean logic and some applications to proof theory ⋮ A graphical foundation for interleaving in game semantics ⋮ On the decision problem for MELL ⋮ On the Proof Complexity of Cut-Free Bounded Deep Inference ⋮ Unnamed Item ⋮ The problem of proof identity, and why computer scientists should care about Hilbert's 24th problem ⋮ Unnamed Item ⋮ On Compositionality of Dinatural Transformations ⋮ True Concurrency of Deep Inference Proofs ⋮ Some Observations on the Proof Theory of Second Order Propositional Multiplicative Linear Logic ⋮ Transformations via Geometric Perspective Techniques Augmented with Cycles Normalization ⋮ Deep inference and expansion trees for second-order multiplicative linear logic ⋮ Minimal type inference for linked data consumers

This page was built for publication: Normalisation Control in Deep Inference via Atomic Flows