Fragments of HA based on _ 1-induction
DOI10.1007/S001530050081zbMATH Open0886.03040OpenAlexW2050152670MaRDI QIDQ1920237FDOQ1920237
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
Recommendations
primitive recursive functionsprovably recursive functionsprenex formulasquantifier alternationKleene's recursive realizabilityprimitive recursive choice functions
First-order arithmetic and fragments (03F30) Recursive functions and relations, subrecursive hierarchies (03D20)
Cited In (15)
- Homomorphisms and chains of Kripke models
- Provably recursive functions of constructive and relatively constructive theories
- Substitutions of \(\Sigma_1^0\)-sentences: Explorations between intuitionistic propositional logic and intuitionistic arithmetic
- A note on uniform density in weak arithmetical theories
- 2002 European Summer Meeting of the Association for Symbolic Logic Logic Colloquium '02
- Fragments of Heyting arithmetic
- Elementary arithmetic
- Some weak fragments of HA and certain closure properties
- 2000 Annual Meeting of the Association for Symbolic Logic
- 2003 Annual Meeting of the Association for Symbolic Logic
- A MARRIAGE OF BROUWER’S INTUITIONISM AND HILBERT’S FINITISM I: ARITHMETIC
- Finite sets and infinite sets in weak intuitionistic arithmetic
- Quick cut-elimination for strictly positive cuts
- Intuitionistic open induction and least number principle and the Buss operator
- Intrinsic reasoning about functional programs. II: Unipolar induction and primitive-recursion
This page was built for publication: Fragments of HA based on \(\Sigma_ 1\)-induction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1920237)
