The Functions Provable by First Order Abstraction

DOI10.1007/3-540-45653-8_23zbMath1234.03028OpenAlexW1534957303MaRDI QIDQ2996174

Daniel Leivant

Publication date: 6 May 2011

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-45653-8_23

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Second- and higher-order arithmetic and fragments (03F35)

This page was built for publication: The Functions Provable by First Order Abstraction