On hyperarithmetical realizability
DOI10.1134/S0001434615110073zbMATH Open1382.03081OpenAlexW2258224561MaRDI QIDQ268079FDOQ268079
Authors: A. Yu. Konovalov, V. E. Plisko
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
Recommendations
- Generalized realizability for extensions of the language of arithmetic
- The semantics of realizability for the constructive set theory based on hyperarithmetical predicates
- Modified realizability and predicate logic
- scientific article; zbMATH DE number 3557757
- Strictly primitive recursive realizability, I
universal functionformal arithmetichyperarithmetical functionhyperarithmetical predicatehyperarithmetical realizabilityhyperarithmetical setGödel number
Subsystems of classical logic (including intuitionistic logic) (03B20) Recursive functions and relations, subrecursive hierarchies (03D20) Second- and higher-order arithmetic and fragments (03F35)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A propositional logic with explicit fixed points
- A survey of predicate realizability logic
- ABSOLUTE REALIZABILITY OF PREDICATE FORMULAS
- Title not available (Why is that?)
- On the interpretation of intuitionistic number theory
- Basic predicate calculus
Cited In (15)
- General recursive realizability and basic logic
- Hartmanis-Stearns Conjecture on Real Time and Transcendence
- On mathematical realism and applicability of hyperreals
- The semantics of realizability for the constructive set theory based on hyperarithmetical predicates
- Title not available (Why is that?)
- Realisability for infinitary intuitionistic set theory
- Realizability with a local operator of A. M. Pitts
- On arithmetically realizable classes
- Basic predicate calculus is sound with respect to a modified version of strictly primitive recursive realizability
- A Generalized Realizability and Intuitionistic Logic
- Generalized realizability for extensions of the language of arithmetic
- Extension of Lifschitz' realizability to higher order arithmetic, and a solution to a problem of F. Richman
- Generalized realizability and Markov's principle
- General recursive realizability and intuitionistic logic
- Absolute \(L\)-realizability and intuitionistic logic
This page was built for publication: On hyperarithmetical realizability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q268079)