Strictly primitive recursive realizability, I

DOI10.2307/2275700zbMath0816.03029OpenAlexW2152679086MaRDI QIDQ4323037

Zlatan Damnjanovic

Publication date: 20 July 1995

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

Full work available at URL: https://doi.org/10.2307/2275700

zbMATH Keywords

soundnessintuitionistic arithmeticfalsifiabilityprimitive recursive realizabilityfragment of Heyting arithmetic

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Intuitionistic mathematics (03F55)

Related Items (9)

A Generalized Realizability and Intuitionistic Logic ⋮ General recursive realizability and basic logic ⋮ Elementary realizability ⋮ THE NONARITHMETICITY OF THE PREDICATE LOGIC OF STRICTLY PRIMITIVE RECURSIVE REALIZABILITY ⋮ Basic predicate calculus is sound with respect to a modified version of strictly primitive recursive realizability ⋮ General recursive realizability and intuitionistic logic ⋮ Strictly primitive recursive realizability. II: Completeness with respect to iterated reflection and a primitive recursive \(\omega\)-rule ⋮ Basic predicate calculus is not sound with respect to the strong variant of strictly primitive recursive realizability ⋮ Polynomially bounded recursive realizability

Cites Work

• Unnamed Item
• Classes of recursive functions based on Ackermann's function
• Syntactic translations and provably recursive functions
• Enumeration and the Grzegorczyk Hierarchy
• Equivalence of some Hierarchies of Primitive Recursive Functions

This page was built for publication: Strictly primitive recursive realizability, I