Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA-Reference-Cited by-同舟云学术

Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA

Published:2006-03-07 Issue:1 Volume:2 Page:
ISSN:1860-5974
Container-title:Logical Methods in Computer Science
language:en
Short-container-title:Log.Meth.Comput.Sci.

Author:

Conradie Willem,Goranko Valentin,Vakarelov Dimiter

Publisher

Centre pour la Communication Scientifique Directe (CCSD)

Subject

General Computer Science,Theoretical Computer Science

Reference29 articles.

1. Untersuchungen �ber das Eliminationsproblem der mathematischen Logik

2. P. Blackburn, M. de Rijke, and Y. Venema. Modal Logic. Cambridge University Press, 2001.

3. An undecidable problem in correspondence theory

4. W. Conradie, V. Goranko, and D. Vakarelov. Elementary canonical formulae: a survey on syntactic, algorithmic, and model-theoretic aspects. In: R. Schmidt, I. Pratt-Hartmann, M. Reynolds, and H. Wansing (editors). \textbfAdvances in Modal Logic, vol. 5, Kings College London, 2005, pages 17-51.

5. W. Conradie, V. Goranko, and D. Vakarelov. Algorithmic correspondence and completeness in modal logic II: Polyadic and hybrid extensions of the algorithm SQEMA. 2006, submitted.

Cited by 52 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Modal reduction principles across relational semantics;Fuzzy Sets and Systems;2024-04

2. Correspondence and canonicity theory of quasi-inequalities andΠ2-statements in modal subordination algebras;Logic Journal of the IGPL;2023-03-17

3. Sahlqvist correspondence theory for second-order propositional modal logic;Journal of Logic and Computation;2022-05-28

4. Guilty Minds and Collective Know-how;Synthese Library;2021-11-13

5. Modal Mantık için Algoritmik Tekabül;Osmaniye Korkut Ata Üniversitesi Fen Bilimleri Enstitüsü Dergisi;2021-11-09