Logic Beyond Formulas

DOI10.1145/3373718.3394763zbMath1498.03156arXiv2012.01102OpenAlexW3032692372WikidataQ130829088 ScholiaQ130829088MaRDI QIDQ5145617

Lutz Straßburger, Matteo Acclavio, Ross Horne

Publication date: 21 January 2021

Published in: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

cut eliminationsplittingproof theorycographsprime graphsdeep inferenceanalycitygraph modules

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Cut-elimination and normal-form theorems (03F05) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Related Items (4)

An Analytic Propositional Proof System on Graphs ⋮ Enumerating Independent Linear Inferences ⋮ A System of Interaction and Structure III: The Complexity of BV and Pomset Logic ⋮ Unnamed Item

This page was built for publication: Logic Beyond Formulas