Minimal readability of intuitionistic arithmetic and elementary analysis
From MaRDI portal
Publication:4876321
DOI10.2307/2275884zbMath0854.03054OpenAlexW2133713329MaRDI QIDQ4876321
Publication date: 13 January 1997
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2275884
Heyting arithmeticPeano arithmeticSkolem functionsdefinable functionsprovably recursive functionsintuitionistic finite-type arithmeticelementary analysisminimal realizability
Related Items (5)
A Generalized Realizability and Intuitionistic Logic ⋮ General recursive realizability and basic logic ⋮ Elementary realizability ⋮ General recursive realizability and intuitionistic logic ⋮ Polynomially bounded recursive realizability
Cites Work
This page was built for publication: Minimal readability of intuitionistic arithmetic and elementary analysis