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


Algorithmic Correspondence and Completeness in Modal Logic. II. Polyadic and Hybrid Extensions of the Algorithm SQEMA
Authors:Conradie, Willem   Goranko, Valentin   Vakarelov, Dimiter
Affiliation:Department of Mathematics, University of Johannesburg and School of Mathematics, University of the Witwatersrand, Johannesburg, South Africa. E-mail: wec{at}rau.ac.za
Abstract:
Keywords:Algorithm SQEMA   polyadic modal logic   hybrid logic   first-order correspondence   canonicity   completeness
本文献已被 Oxford 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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