Strictly primitive recursive realizability, I

DOI10.2307/2275700MaRDI QIDQ4323037zbMATH OpenOpenAlexFDO

Authors 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

falsifiabilityfragment of Heyting arithmeticintuitionistic arithmeticprimitive recursive realizabilitysoundness

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2019914
• Elementary realizability
• scientific article; zbMATH DE number 5174279
• Minimal readability of intuitionistic arithmetic and elementary analysis
• On Primitive Recursive Realizabilities

Cites work

• Classes of recursive functions based on Ackermann's function
• Enumeration and the Grzegorczyk Hierarchy
• Equivalence of some Hierarchies of Primitive Recursive Functions
• scientific article; zbMATH DE number 3857078 (Why is no real title available?)
• Syntactic translations and provably recursive functions

Cited in

(18)

• Elementary realizability
• Basic predicate calculus is not sound with respect to the strong variant of strictly primitive recursive realizability
• General recursive realizability and intuitionistic logic
• Realizability with a local operator of A. M. Pitts
• On hyperarithmetical realizability
• On Primitive Recursive Realizabilities
• scientific article; zbMATH DE number 2019914 (Why is no real title available?)
• THE NONARITHMETICITY OF THE PREDICATE LOGIC OF STRICTLY PRIMITIVE RECURSIVE REALIZABILITY
• scientific article; zbMATH DE number 5174279 (Why is no real title available?)
• Realizability interpretation of PA by iterated limiting PCA
• A Generalized Realizability and Intuitionistic Logic
• Logical Approaches to Computational Barriers
• Strictly primitive recursive realizability. II: Completeness with respect to iterated reflection and a primitive recursive -rule
• Arithmetic complexity of the predicate logics of certain complete arithmetic theories
• Basic predicate calculus is sound with respect to a modified version of strictly primitive recursive realizability
• Polynomially bounded recursive realizability
• General recursive realizability and basic logic
• Primitive recursive selection functions for existential assertions over abstract algebras

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4323037)