scientific article; zbMATH DE number 4181310

zbMATH Open0717.03008MaRDI QIDQ3204445FDOQ3204445

Authors: Jeffrey Remmel, Andre Scedrov, Anil Nerode 

Publication date: 1989

Title of this publication is not available (Why is that?)

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
• Publication:4723705
• Polynomial semantics for modal logics
• scientific article

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)

Cited In (4)

• Graded multicategories of polynomial-time realizers
• 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)