Feasible Operations and Applicative Theories Based on λη

DOI<link itemprop=identifier href="https://doi.org/10.1002/1521-3870(200008)46:3<291::AID-MALQ291>3.0.CO;2-T" /><291::AID-MALQ291>3.0.CO;2-T 10.1002/1521-3870(200008)46:3<291::AID-MALQ291>3.0.CO;2-TzbMath0968.03067OpenAlexW2057094492MaRDI QIDQ4511545

Andrea Cantini

Publication date: 4 July 2001

Full work available at URL: https://doi.org/10.1002/1521-3870(200008)46:3<291::aid-malq291>3.0.co;2-t

zbMATH Keywords

applicative theoriespolynomial time computabilityasymmetric interpretation

Mathematics Subject Classification ID

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

Related Items (2)

Theories with self-application and computational complexity. ⋮ Remarks on applicative theories

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