可拓逻辑的可满足性问题研究  

Study on Satisfiability Problem of Extension Logic

作　　者：陈智斌[1] 贾西平[1] 肖政宏[1] 

机构地区：[1]广东技术师范学院计算机科学学院,广东广州510665

出　　处：《数学的实践与认识》2015年第12期266-272,共7页Mathematics in Practice and Theory

基　　金：广东省教育厅科研项目(2013KJCX0117)

摘　　要：可满足性是逻辑语义理论的基本概念.在分析基元命题内部的逻辑形式的基础上,研究了可拓逻辑的语法及语义理论,给出了可拓逻辑中的可满足性定义.讨论了矛盾问题的可拓逻辑表示,并给出了基于可满足性概念的矛盾问题定义和表示实例.Satisfiability is the elementary concept of logical semantics. In this paper, with the analysis of the logical form inside basic-element proposition, the syntax and semantics of extension logic is studied. The definition of satisfiability in extension logic is given. The representation of contradictory problem by extension logic is discussed. On the basis of the concept of satisfiability, the definition and representation examples of contradictory problem are given.

关 键 词：可拓逻辑 可满足性 矛盾问题 

分 类 号：O141[理学—数学]