Dual realizability in symmetric logic

被引:0
|
作者
Zaslavsky, ID [1 ]
机构
[1] Natl Acad Sci Armenia, Inst Informat & Automat Problems, Yerevan, Armenia
[2] Yerevan State Univ, Yerevan 375049, Armenia
关键词
realizability; calculus; predicate; quantifier;
D O I
暂无
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
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. (C) 2002 Elsevier Science B.V. All rights reserved.
引用
下载
收藏
页码:389 / 397
页数:9
相关论文
共 50 条