RUS  ENG
Full version
JOURNALS // Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika // Archive

Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2016 Number 4, Pages 60–64 (Mi vmumm169)

This article is cited in 4 papers

Short notes

Arithmetical realizability and primitive recursive realizability

A. Yu. Konovalov

Lomonosov Moscow State University, Faculty of Mechanics and Mathematics

Abstract: The semantics of the predicate logic based on the absolute arithmetical realizability is proved to differ from the semantics based on the primitive recursive realizability by Salehi.

Key words: constructive semantics, absolute realizability, formal arithmetic, arithmetical realizability, primitive recursive realizability.

UDC: 510.25; 510.64

Received: 23.10.2015


 English version:
Moscow University Mathematics Bulletin, Moscow University Mеchanics Bulletin, 2016, 71:4, 166–169

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2026