scientific article; zbMATH DE number 7360325
From MaRDI portal
Publication:4994195
zbMath1474.03074MaRDI QIDQ4994195
Publication date: 17 June 2021
Full work available at URL: https://www.fmi.uni-sofia.bg/en/node/7773
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Uses Software
Cites Work
- Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA
- An essay in combinatory dynamic logic
- PDL with data constants
- Modal logic with names
- Elementary canonical formulae: extending Sahlqvist's theorem
- Sahlqvist Formulas in Hybrid Polyadic Modal Logics
- Algorithmic Correspondence and Completeness in Modal Logic. II. Polyadic and Hybrid Extensions of the Algorithm SQEMA
- IV. Semantic extensions of SQEMA
- An undecidable problem in correspondence theory
- On the Correspondence Between Modal and Classical Logic: an Automated Approach
- Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
