The functions provable by first order abstraction

DOI10.1007/3-540-45653-8_23MaRDI QIDQ2996174zbMATH OpenOpenAlexFDO

Authors Daniel M. 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

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

Recommendations

• scientific article; zbMATH DE number 177847
• Feasible functions over co-inductive data
• The completeness of functional logic
• Adapting functional programs to higher order logic
• scientific article; zbMATH DE number 432708

Cited in

(1)

• Proof-functional connectives and realizability

This page was built for publication: The functions provable by first order abstraction

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