On the decidability of open logic  

作　　者：ZHANG Wei 

机构地区：[1]Northeastern University, Neusoft Institute of Information, Dalian 116023, China

出　　处：《Science in China(Series F)》2009年第8期1283-1291,共9页中国科学（F辑英文版）

摘　　要：Open logic （OL） is a noticeable logic theory dealing with the description of knowledge growth and updating, as well as the evolution of hypothesis. Up to now, however, many problems related to the proof theoretical approach of OL remain to be explored. In this paper, the typical proof theoretical problems for OL are described and the concept of open proof is defined. Two major conclusions are as follows： （i） For the consistent OL systems, the open proof problem is semi-decidable （a decision algorithm is presented）. （ii） For general （normal, not necessarily consistent） OL systems, the open proof problem is not semi-decidable.Open logic （OL） is a noticeable logic theory dealing with the description of knowledge growth and updating, as well as the evolution of hypothesis. Up to now, however, many problems related to the proof theoretical approach of OL remain to be explored. In this paper, the typical proof theoretical problems for OL are described and the concept of open proof is defined. Two major conclusions are as follows： （i） For the consistent OL systems, the open proof problem is semi-decidable （a decision algorithm is presented）. （ii） For general （normal, not necessarily consistent） OL systems, the open proof problem is not semi-decidable.

关 键 词：open logic epistemic process DECIDABILITY 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程] O141.1[自动化与计算机技术—控制科学与工程]