scientific article; zbMATH DE number 1231522

zbMath0908.03051MaRDI QIDQ4222837

John C. Mitchell, Patrick D. Lincoln, Andrej Scedrov

Publication date: 13 December 1998

Full work available at URL: http://www.elsevier.com/cas/tree/store/tcs/free/noncas/pc/volume3.htm#lincoln

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

complexitylinear logicproof searchproof treeadditive fragmentmultiplicative fragmentproof games

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Structure of proofs (03F07) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Subsystems of classical logic (including intuitionistic logic) (03B20)

This page was built for publication: