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


An Elementary Construction for a Non-elementary Procedure
Authors:Marx  Maarten  Mikulás  Szabolcs
Affiliation:(1) Language and Inference Technology Group, ILLC, Universiteit van Amsterdam, Nieuwe Achtergracht 166, 1018 WV Amsterdam, The Netherlands;(2) School of Computer Science and Information Systems, Birkbeck College, University of London, Malet Street, London, WC1E 7HX, UK
Abstract:We consider the problem of the product finite model property for binary products of modal logics. First we give a new proof for the product finite model property of the logic of products of Kripke frames, a result due to Shehtman. Then we modify the proof to obtain the same result for logics of products of Kripke frames satisfying any combination of seriality, reflexivity and symmetry. We do not consider the transitivity condition in isolation because it leads to infinity axioms when taking products.
Keywords:modal logic  product of modal logics  finite model property  decidability
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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