Similar Items: Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA
- On Natural Deduction for Herbrand Constructive Logics I: Curry-Howard Correspondence for Dummett's Logic LC
- Completeness for the coalgebraic cover modality
- Modal Logics of Topological Relations
- Modal meet-implication logic
- Interactive Small-Step Algorithms I: Axiomatization
- On the meaning of logical completeness