scientific article
From MaRDI portal
Publication:3204445
zbMath0717.03008MaRDI QIDQ3204445
Andrej Scedrov, Jeffery B. Remmel
Publication date: 1989
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
resource boundsformal program specificationlogical framework for programming languagespolynomially graded logicsPTIME functionsrestriction of Gödel's system T to polynomial time resources
Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Complexity of computation (including implicit computational complexity) (03D15)
Related Items (3)
Graded multicategories of polynomial-time realizers ⋮ Computation models and function algebras ⋮ Bounded linear logic: A modular approach to polynomial-time computability
This page was built for publication:
