Intrinsic theories and computational complexity

DOI10.1007/3-540-60178-3_84OpenAlexW1581416890MaRDI QIDQ6064281

Daniel Leivant

Publication date: 12 December 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60178-3_84

zbMATH Keywords

free algebraproof theorynatural deductionfinite typerecursive function

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Related Items (1)

A characterization of polynomial time computable functions from the integers to the reals using discrete ordinary differential equations

Cites Work

• The realm of primitive recursion
• Constructivism in mathematics. An introduction. Volume I
• A new recursion-theoretic characterization of the polytime functions
• A foundational delineation of poly-time
• ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
• Syntactic translations and provably recursive functions
• Free-variable axiomatic foundations of infinitesimal analysis: A fragment with finitary consistency proof
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Intrinsic theories and computational complexity