A Proof Calculus Which Reduces Syntactic Bureaucracy

From MaRDI portal

Revision as of 01:01, 9 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5389140

Jump to:navigation, search

DOI10.4230/LIPICS.RTA.2010.135zbMath1236.68131OpenAlexW1534718845MaRDI QIDQ5389140

Tom Gundersen, Michel Parigot, Alessio Guglielmi

Publication date: 25 April 2012

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_ca00.html

zbMATH Keywords

proof theory confluence rewriting termination proof systems flow graphs deep inference open deduction

Mathematics Subject Classification ID

Logic in computer science (03B70) Grammars and rewriting systems (68Q42)

Related Items (9)

A Subatomic Proof System for Decision Trees ⋮ An Analytic Propositional Proof System on Graphs ⋮ Combinatorial flows as bicolored atomic flows ⋮ Node Replication: Theory And Practice ⋮ Spinal atomic \(\lambda\)-calculus ⋮ Unnamed Item ⋮ The spirit of node replication ⋮ On the Proof Complexity of Cut-Free Bounded Deep Inference ⋮ True Concurrency of Deep Inference Proofs

This page was built for publication: A Proof Calculus Which Reduces Syntactic Bureaucracy

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5389140&oldid=20113795"