Dual realizability in symmetric logic

https://doi.org/10.1016/S0168-0072(01)00068-9Get rights and content
Under an Elsevier user license
open archive

Abstract

A variant of the notion of symmetric constructive realizability is introduced where the information about the symmetric constructive truth or falsity of an arithmetical formula is expressed by a single natural number. The methods of transformations of such a realization to the realizations of known kinds and those of reverse transformations are given. The formal arithmetical system based on such a realizability is investigated.

Keywords

Realizability
Calculus
Predicate
Quantifier

Cited by (0)