|
Intelligent systems. Theory and applications, 2021, Volume 25, Issue 2, Pages 49–54
(Mi ista302)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Part 2. Special Issues in Intellectual Systems Theory
Basic logic is sound with respect to absolute $L$-realizability
A. Yu. Konovalov Lomonosov Moscow State University
Abstract:
An absolute $L$-realizability of predicate formulas is introduced for all countable extensions $L$ of the language of arithmetic. It is proved that the basic logic is sound with this semantics.
Keywords:
constructive semantics, realizability, absolute realizability, formal arithmetic, basic logic.
Citation:
A. Yu. Konovalov, “Basic logic is sound with respect to absolute $L$-realizability”, Intelligent systems. Theory and applications, 25:2 (2021), 49–54
Linking options:
https://www.mathnet.ru/eng/ista302 https://www.mathnet.ru/eng/ista/v25/i2/p49
|
|