scientific article; zbMATH DE number 4181310

MaRDI QIDQ3204445zbMATH OpenFDO

Authors Jeffrey Remmel, Andre Scedrov, Anil Nerode

Publication date 1989

zbMATH Keywords

resource boundsformal program specificationlogical framework for programming languagespolynomially graded logicsPTIME functionsrestriction of Gödel's system T to polynomial time resources

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70) Complexity of computation (including implicit computational complexity) (03D15)

Recommendations

• Graded tableaux for Rational Pavelka Logic
• On polynomial semantics for propositional logics
• A new graded method for the propositional logic L_n
• A logic-algebraic approach to graded inclusion
• A logical framework for graded predicates
• On the superstructure of the class of polynomials in multivalued logics
• \(\mathit{Log}_A\mathbf{G}\): an algebraic non-monotonic logic for reasoning with graded propositions
• scientific article; zbMATH DE number 3995630
• Polynomial semantics for modal logics
• scientific article; zbMATH DE number 5880291

Cited in

(5)

• Graded multicategories of polynomial-time realizers
• Expressing computational complexity in constructive type theory
• Bounded linear logic: A modular approach to polynomial-time computability
• Time bounds for general function pointers
• Computation models and function algebras

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3204445)