scientific article; zbMATH DE number 1114018
From MaRDI portal
Publication:4375787
zbMath0892.03024MaRDI QIDQ4375787
Publication date: 30 June 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Complexity of computation (including implicit computational complexity) (03D15) First-order arithmetic and fragments (03F30) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of proofs (03F20)
Related Items
The equivalence of theories that characterize ALogTime ⋮ A second-order system for polytime reasoning based on Grädel's theorem. ⋮ A bounded arithmetic AID for Frege systems ⋮ Tractability of cut-free Gentzen-type propositional calculus with permutation inference. II