On hyperarithmetical realizability

DOI10.1134/S0001434615110073zbMath1382.03081OpenAlexW2258224561MaRDI QIDQ268079

F. Blanchet-Sadri, M. Dambrine

Publication date: 14 April 2016

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0001434615110073

zbMATH Keywords

universal functionformal arithmeticGödel numberhyperarithmetical functionhyperarithmetical predicatehyperarithmetical realizabilityhyperarithmetical set

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Second- and higher-order arithmetic and fragments (03F35) Subsystems of classical logic (including intuitionistic logic) (03B20)

Related Items (7)

A Generalized Realizability and Intuitionistic Logic ⋮ General recursive realizability and basic logic ⋮ Basic predicate calculus is sound with respect to a modified version of strictly primitive recursive realizability ⋮ General recursive realizability and intuitionistic logic ⋮ Generalized realizability for extensions of the language of arithmetic ⋮ Absolute \(L\)-realizability and intuitionistic logic ⋮ Generalized realizability and Markov's principle

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A propositional logic with explicit fixed points
• A survey of predicate realizability logic
• ABSOLUTE REALIZABILITY OF PREDICATE FORMULAS
• On the interpretation of intuitionistic number theory
• Basic predicate calculus

This page was built for publication: On hyperarithmetical realizability