This article is cited 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.