On Primitive Recursive Realizabilities

DOI10.1007/11753728_31MaRDI QIDQ3434704zbMATH OpenOpenAlexFDO

Authors Valery Plisko

Publication date 2 May 2007

Published in Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11753728_31

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2019914
• scientific article; zbMATH DE number 5174279
• Strictly primitive recursive realizability, I
• Strictly primitive recursive realizability. II: Completeness with respect to iterated reflection and a primitive recursive -rule
• Minimal readability of intuitionistic arithmetic and elementary analysis

Cited in

(9)

• On the minimal solution of the problem of primitives
• General recursive realizability and intuitionistic logic
• Strictly primitive recursive realizability, I
• 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?)
• Primitive recursive real numbers
• scientific article; zbMATH DE number 3310899 (Why is no real title available?)
• Strictly primitive recursive realizability. II: Completeness with respect to iterated reflection and a primitive recursive -rule

This page was built for publication: On Primitive Recursive Realizabilities

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