首页 | 本学科首页   官方微博 | 高级检索  
   检索      

NExt(S4)中Bull逻辑再探
引用本文:马明辉.NExt(S4)中Bull逻辑再探[J].逻辑学研究,2013(1):27-38.
作者姓名:马明辉
作者单位:西南大学逻辑与智能研究中心
基金项目:supported by the project Modal Definability Theory of China National Funding of Social Sciences (Grant No.12CZX054);the project The Syntactical Approach to Modal Completeness Theory of China Ministry of Education (Grant No. 12YJC72040001)
摘    要:本文重新考察Bull在1964给出的一个结论:以纯句法方式定义的一些扩张S4的正规模态逻辑具有有穷模型性质。本文修订Bull的代数证明。对于新定义的S4的Bull公式,证明通过它们在S4基础上生成的正规模态逻辑都具有有穷模型性质。这是关于模态逻辑的有穷模型性质的句法结论。本文还证明,相对于所有克里普克框架类而言,并非所有S4的Bull公式都具有一阶对应句子。

关 键 词:模态逻辑  代数证明  克里普克  性质  定义  句法

Bull's Logics in NExt(S4) Revisited
Minghui Ma.Bull's Logics in NExt(S4) Revisited[J].Studies in Logic,2013(1):27-38.
Authors:Minghui Ma
Institution:Minghui Ma Center for the Study of Logic and Intelligence, Southwest University
Abstract:We revisit a result given by Robert Bull in 5] that certain logics in NExt(S4) de- fined by a pure syntax have finite model property and fix Bull's algebraic proof. We show that every logic in NExt(S4) generated by our new Bull formulas for S4 have finite model property. This is a syntactical result about finite model property of modal logics. We also show that not all Bull formulas for S4 have first-order correspondent with respect the class of all Kripke frames.
Keywords:
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号