Fragments of HA based on \(\Sigma_ 1\)-induction

DOI10.1007/s001530050081zbMath0886.03040OpenAlexW2050152670MaRDI QIDQ1920237

Kai Frederick Wehmeier

Publication date: 25 September 1996

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

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

zbMATH Keywords

primitive recursive functionsprovably recursive functionsprenex formulasquantifier alternationKleene's recursive realizabilityprimitive recursive choice functions

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Recursive functions and relations, subrecursive hierarchies (03D20)

Related Items

2000 Annual Meeting of the Association for Symbolic Logic, Some weak fragments of HA and certain closure properties, A MARRIAGE OF BROUWER’S INTUITIONISM AND HILBERT’S FINITISM I: ARITHMETIC, Quick cut-elimination for strictly positive cuts, A note on uniform density in weak arithmetical theories, Provably recursive functions of constructive and relatively constructive theories, Homomorphisms and chains of Kripke models, Intuitionistic open induction and least number principle and the Buss operator, Elementary arithmetic, 2003 Annual Meeting of the Association for Symbolic Logic, 2002 European Summer Meeting of the Association for Symbolic Logic Logic Colloquium '02, Intrinsic reasoning about functional programs. II: Unipolar induction and primitive-recursion, Finite sets and infinite sets in weak intuitionistic arithmetic