Feasible Operations and Applicative Theories Based on λη

DOI10.1002/1521-3870(200008)46:3%3C291::AID-MALQ291%3E3.0.CO;2-TMaRDI QIDQ4511545zbMATH OpenOpenAlexFDO

Authors Andrea Cantini

Publication date 4 July 2001

Full work available at URL https://doi.org/10.1002/1521-3870(200008)46:3%3C291::aid-malq291%3E3.0.co;2-t

zbMATH Keywords

polynomial time computabilityapplicative theoriesasymmetric interpretation

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) First-order arithmetic and fragments (03F30) Complexity of computation (including implicit computational complexity) (03D15)

Recommendations

• Theories with self-application and computational complexity.
• Polynomial time operations in explicit mathematics
• A syntactical analysis of non-size-increasing polynomial time computation
• A feasible theory of truth over combinatory algebra
• Elementary explicit types and polynomial time operations

Cited in

(3)

• Remarks on applicative theories
• Theories with self-application and computational complexity.
• Elementary explicit types and polynomial time operations

This page was built for publication: Feasible Operations and Applicative Theories Based on λη

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