All absolute arithmetically realizable predicate formulas are classically true

A. Yu. Konovalov

Lomonosov Moscow State University, Faculty of Mechanics and Mathematics

Abstract: It is proved that every absolute arithmetically realizable predicate formula is classically true, but there is a classically true predicate formula that is not absolute arithmetically realizable.

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