The Consistency and Complexity of Multiplicative Additive System Virtual

DOI10.7561/SACS.2015.2.245zbMath1424.03057MaRDI QIDQ4621196

Ross Horne

Publication date: 8 February 2019

Published in: Scientific Annals of Computer Science (Search for Journal in Brave)

zbMATH Keywords

proof theorydeep inferencenon-commutative logic

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Cut-elimination and normal-form theorems (03F05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Complexity of proofs (03F20)

Related Items (6)

An Analytic Propositional Proof System on Graphs ⋮ On orderings in security models ⋮ A System of Interaction and Structure III: The Complexity of BV and Pomset Logic ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Constructing weak simulations from linear implications for processes with private names

This page was built for publication: The Consistency and Complexity of Multiplicative Additive System Virtual