An intuitionistic fixed point theory

DOI10.1007/s001530050079zbMath0903.03034OpenAlexW1987795668MaRDI QIDQ1386672

Wilfried Buchholz

Publication date: 14 December 1998

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

Full work available at URL: https://doi.org/10.1007/s001530050079

zbMATH Keywords

proof theoryconservative extensiontransfinite inductioninductive definitionsGödel translationalmost negative formulasderivability predicateextension of Heyting arithmeticfixed point axiomsemi-formal theorystrongly positive formula

Mathematics Subject Classification ID

Second- and higher-order arithmetic and fragments (03F35) Intuitionistic mathematics (03F55) Relative consistency and interpretations (03F25)

Related Items

Revisiting the conservativity of fixpoints over intuitionistic arithmetic, Quick cut-elimination for strictly positive cuts, Intuitionistic fixed point theories over set theories, On Relating Theories: Proof-Theoretical Reduction, Some results on cut-elimination, provable well-orderings, induction and reflection