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.
Original language | English |
---|---|
Pages (from-to) | 389-397 |
Number of pages | 9 |
Journal | Annals of Pure and Applied Logic |
Volume | 113 |
Issue number | 1-3 |
DOIs | |
State | Published - 27 Dec 2001 |
Externally published | Yes |
Keywords
- Calculus
- Predicate
- Quantifier
- Realizability
ASJC Scopus subject areas
- Logic