Minimal readability of intuitionistic arithmetic and elementary analysis
From MaRDI portal
Publication:4876321
DOI10.2307/2275884zbMath0854.03054MaRDI 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 arithmetic; Peano arithmetic; Skolem functions; definable functions; provably recursive functions; intuitionistic finite-type arithmetic; elementary analysis; minimal realizability
Related Items
Polynomially bounded recursive realizability, General recursive realizability and basic logic, Elementary realizability, General recursive realizability and intuitionistic logic
Cites Work