Generalized realizability for extensions of the language of arithmetic
From MaRDI portal
Publication:2287392
DOI10.3103/S0027132219040065zbMATH Open1454.03079OpenAlexW2970314527WikidataQ127322282 ScholiaQ127322282MaRDI QIDQ2287392FDOQ2287392
Authors: A. Yu. Konovalov 
Publication date: 20 January 2020
Published in: Moscow University Mathematics Bulletin (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3103/s0027132219040065
Recommendations
- Generalized Realizability and Basic Logic
- A Generalized Realizability and Intuitionistic Logic
- scientific article; zbMATH DE number 21247
- A realizability interpretation for classical analysis
- scientific article; zbMATH DE number 1157225
- On the structure of classical realizability models of ZF
- Provably total functions of Basic Arithmetic
- Generalized realizability and Markov's principle
- A new technique for proving realisability and consistency theorems using finite paraconsistent models of cut-free logic
- Absolute \(L\)-realizability and intuitionistic logic
First-order arithmetic and fragments (03F30) Metamathematics of constructive systems (03F50) Intuitionistic mathematics (03F55)
Cites Work
Cited In (7)
- General recursive realizability and basic logic
- Generalized Realizability and Basic Logic
- On hyperarithmetical realizability
- Title not available (Why is that?)
- A CHARACTERIZATION OF THE ARITHMETICAL HIERARCHY BY LANGUAGE EQUATIONS
- A Generalized Realizability and Intuitionistic Logic
- Extension of Lifschitz' realizability to higher order arithmetic, and a solution to a problem of F. Richman
This page was built for publication: Generalized realizability for extensions of the language of arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2287392)
