A proof-theoretical analysis of semiconstructive intermediate theories

DOI10.1023/A:1022985222183zbMATH Open1015.03059MaRDI QIDQ1868239FDOQ1868239

Authors: Mauro Ferrari, Camillo Fiorentini 

Publication date: 27 April 2003

Published in: Studia Logica (Search for Journal in Brave)

Recommendations

• On Uniformly Constructive and Semiconstructive Formal Systems
• scientific article; zbMATH DE number 4089536
• scientific article; zbMATH DE number 16881
• Provably recursive functions of constructive and relatively constructive theories
• Extracting information from intermediate semiconstructive HA-systems -- extended abstract

zbMATH Keywords

computabilityMarkov's principleinformation extractionbounded complexityintermediate semiconstructive systemssemiconstructive theories

Mathematics Subject Classification ID

Logic in computer science (03B70) Metamathematics of constructive systems (03F50)

Cited In (6)

• Title not available (Why is that?)
• Title not available (Why is that?)
• A Proof Theoretic Analysis of Intruder Theories
• A proof theoretic analysis of intruder theories
• Proof analysis in intermediate logics
• On Uniformly Constructive and Semiconstructive Formal Systems

This page was built for publication: A proof-theoretical analysis of semiconstructive intermediate theories

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