Elementary realizability

DOI10.1023/A:1017994504149zbMath0874.03067OpenAlexW4238150421MaRDI QIDQ1362589

Zlatan Damnjanovic

Publication date: 5 November 1997

Published in: Journal of Philosophical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1017994504149

zbMATH Keywords

provably recursive functionselementary realizabilityfragment of Heyting ArithmeticKalmar elementary functionsstrict arithmetic constructivism

Mathematics Subject Classification ID

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

Related Items (3)

Elementary functions and loop programs ⋮ Strictly primitive recursive realizability. II: Completeness with respect to iterated reflection and a primitive recursive \(\omega\)-rule ⋮ Polynomially bounded recursive realizability

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The intended interpretation of intuitionistic logic
• Constructivism in mathematics. An introduction. Volume II
• Elementary functions and loop programs
• Theory of Formal Systems. (AM-47)
• Classes of Predictably Computable Functions
• The bounded arithmetic hierarchy
• Strictly primitive recursive realizability, I
• Minimal readability of intuitionistic arithmetic and elementary analysis
• Hierarchies of Primitive Recursive Functions
• ÜBER DIE ELIMINIERBARKEIT VON DEFINITIONSSCHEMATA IN DER THEORIE DER REKURSIVEN FUNKTIONEN
• Existence and feasibility in arithmetic
• A Hierarchy of Primitive Recursive Functions

This page was built for publication: Elementary realizability