scientific article; zbMATH DE number 2222014

zbMath1083.03020MaRDI QIDQ5702663

Andrea Cantini

Publication date: 2 November 2005

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computational complexityapplicative theories

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Recursive functions and relations, subrecursive hierarchies (03D20) Metamathematics of constructive systems (03F50) Combinatory logic and lambda calculus (03B40)

Related Items (8)

A feasible theory of truth over combinatory algebra ⋮ The provably terminating operations of the subsystem PETJ of explicit mathematics ⋮ Primitive recursive selection functions for existential assertions over abstract algebras ⋮ A proof-theoretic characterization of the basic feasible functionals ⋮ Elementary explicit types and polynomial time operations ⋮ On the proof theory of type two functionals based on primitive recursive operations ⋮ Realisability in weak systems of explicit mathematics ⋮ Remarks on applicative theories

This page was built for publication: