Extracting Algorithms from Intuitionistic Proofs

DOI10.1002/malq.19980440202zbMath0903.03035OpenAlexW2022907045MaRDI QIDQ4393165

No author found.

Publication date: 5 January 1999

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.19980440202

zbMATH Keywords

bounded arithmeticprovably total functionsintuitionistic subsystems of arithmetic

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) First-order arithmetic and fragments (03F30) Intuitionistic mathematics (03F55)

Related Items (1)

Two General Results on Intuitionistic Bounded Theories

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: Extracting Algorithms from Intuitionistic Proofs