Elementary realizability

DOI10.1023/A:1017994504149zbMATH Open0874.03067OpenAlexW4238150421MaRDI QIDQ1362589FDOQ1362589

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

Recommendations

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

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)

Cites Work

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

Cited In (9)

• Well-foundedness in realizability
• Linear Realizability
• Title not available (Why is that?)
• Strictly primitive recursive realizability, I
• Trivial Reals
• Strictly primitive recursive realizability. II: Completeness with respect to iterated reflection and a primitive recursive \(\omega\)-rule
• Arithmetic complexity of the predicate logics of certain complete arithmetic theories
• Polynomially bounded recursive realizability
• Elementary functions and loop programs

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)