|
This article is cited in 12 scientific papers (total in 12 papers)
On Hyperarithmetical Realizability
A. Yu. Konovalov, V. E. Plisko Lomonosov Moscow State University
Abstract:
The notion of hyperarithmetical realizability is introduced for various extensions of the language of formal arithmetic. The correctness of classical, intuitionistic, and basic logic with respect to the semantics based on hyperarithmetical realizability is studied.
Keywords:
hyperarithmetical realizability, formal arithmetic, hyperarithmetical set, hyperarithmetical predicate, hyperarithmetical function, Gödel number, universal function.
Received: 13.03.2015
Citation:
A. Yu. Konovalov, V. E. Plisko, “On Hyperarithmetical Realizability”, Mat. Zametki, 98:5 (2015), 725–746; Math. Notes, 98:5 (2015), 778–797
Linking options:
https://www.mathnet.ru/eng/mzm10735https://doi.org/10.4213/mzm10735 https://www.mathnet.ru/eng/mzm/v98/i5/p725
|
Statistics & downloads: |
Abstract page: | 401 | Full-text PDF : | 170 | References: | 59 | First page: | 34 |
|