RUS  ENG
Full version
JOURNALS // Intelligent systems. Theory and applications // Archive

Intelligent systems. Theory and applications, 2018 Volume 22, Issue 3, Pages 127–130 (Mi ista153)

This article is cited in 1 paper

The $V$-realizability for $L$-formulas coincides with the classical semantics if $V$ contains all $L$-definable functions

A. Yu. Konovalov

Lomonosov Moscow State University, Faculty of Mechanics and Mathematics

Abstract: Let $L$ be an extension of the language of arithmetic, $V$ a class of number-theoretical functions. A notion of the $V$-realizability for $L$-formulas is defined in such a way that indexes of functions in $V$ are used for interpreting the implication and the universal quantifier. It is proved that the semantics for $L$ based on the $V$-realizability coincides with the classical semantics if $V$ contains all $L$-definable functions.

Keywords: constructive semantics, realizability, generalized realizability, formal arithmetic.



© Steklov Math. Inst. of RAS, 2026