Elementary realizability

DOI10.1023/A:1017994504149MaRDI QIDQ1362589zbMATH OpenOpenAlexFDO

Authors 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) Other constructive mathematics (03F65) Recursive functions and relations, subrecursive hierarchies (03D20)

Recommendations

• Strictly primitive recursive realizability, I
• Minimal readability of intuitionistic arithmetic and elementary analysis
• scientific article; zbMATH DE number 1215498

Cites work

• scientific article; zbMATH DE number 3857078 (Why is no real title available?)
• scientific article; zbMATH DE number 3700811 (Why is no real title available?)
• scientific article; zbMATH DE number 176201 (Why is no real title available?)
• scientific article; zbMATH DE number 3467029 (Why is no real title available?)
• scientific article; zbMATH DE number 3586480 (Why is no real title available?)
• scientific article; zbMATH DE number 3305097 (Why is no real title available?)
• scientific article; zbMATH DE number 3336805 (Why is no real title available?)
• scientific article; zbMATH DE number 3073037 (Why is no real title available?)
• A Hierarchy of Primitive Recursive Functions
• Classes of Predictably Computable Functions
• Constructivism in mathematics. An introduction. Volume II
• Elementary functions and loop programs
• Existence and feasibility in arithmetic
• Hierarchies of Primitive Recursive Functions
• Minimal readability of intuitionistic arithmetic and elementary analysis
• Strictly primitive recursive realizability, I
• The bounded arithmetic hierarchy
• The intended interpretation of intuitionistic logic
• Theory of Formal Systems. (AM-47)
• ÜBER DIE ELIMINIERBARKEIT VON DEFINITIONSSCHEMATA IN DER THEORIE DER REKURSIVEN FUNKTIONEN

Cited in

(9)

• Trivial Reals
• scientific article; zbMATH DE number 1215498 (Why is no real title available?)
• Strictly primitive recursive realizability. II: Completeness with respect to iterated reflection and a primitive recursive \(\omega\)-rule
• Strictly primitive recursive realizability, I
• Arithmetic complexity of the predicate logics of certain complete arithmetic theories
• Polynomially bounded recursive realizability
• Well-foundedness in realizability
• Elementary functions and loop programs
• Linear Realizability

This page was built for publication: Elementary realizability

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