DECIDABILITY OF FINITE FORCING COMPANION  

作　　者：沈恩绍 

机构地区：[1]Beijing Normal University, Beijing 100875, PRC

出　　处：《Chinese Science Bulletin》1990年第15期1315-1315,共1页

摘　　要：It is well known that the finite forcing companion T^f is, in general, hyperarithmetic over T_? . We obtain T^f is T_?-decidable if it ∑₁^T_?. The way of computing, one of the achievements of the 19th century mathematics, was found, by which for each positive primitive formula ψ, a single quantifier-free（Q-free） formula ψ* is equivalent to Res_ψ mod T, where T is the theory of fields. A. Robinson developed a model-theoretic approach, showing the exist-

关 键 词：mathematics PRIMITIVE FORCING showing quant INFINITELY RECURSIVE 切一 树行 

分 类 号：N[自然科学总论]