A proof-theoretical analysis of semiconstructive intermediate theories
From MaRDI portal
Publication:1868239
DOI10.1023/A:1022985222183zbMath1015.03059MaRDI QIDQ1868239
Mauro Ferrari, Camillo Fiorentini
Publication date: 27 April 2003
Published in: Studia Logica (Search for Journal in Brave)
computabilitybounded complexityMarkov's principleinformation extractionintermediate semiconstructive systemssemiconstructive theories
This page was built for publication: A proof-theoretical analysis of semiconstructive intermediate theories