Deterministic SQEMA and application for pre-contact logic
From MaRDI portal
Recommendations
- IV. Semantic extensions of SQEMA
- Algorithmic Correspondence and Completeness in Modal Logic. II. Polyadic and Hybrid Extensions of the Algorithm SQEMA
- Algorithmic correspondence and completeness in modal logic. III. Extensions of the algorithm SQEMA with substitutions
- Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA
- Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA
Cites work
- Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA
- Algorithmic Correspondence and Completeness in Modal Logic. II. Polyadic and Hybrid Extensions of the Algorithm SQEMA
- Algorithmic correspondence and completeness in modal logic. III. Extensions of the algorithm SQEMA with substitutions
- Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA
- An essay in combinatory dynamic logic
- An undecidable problem in correspondence theory
- Elementary canonical formulae: a survey on syntactic, algorithmic, and model-theoretic aspects
- Elementary canonical formulae: extending Sahlqvist's theorem
- scientific article; zbMATH DE number 3499717 (Why is no real title available?)
- scientific article; zbMATH DE number 6302894 (Why is no real title available?)
- scientific article; zbMATH DE number 5241969 (Why is no real title available?)
- IV. Semantic extensions of SQEMA
- Modal logic with names
- On the Correspondence Between Modal and Classical Logic: an Automated Approach
- PDL with data constants
- Sahlqvist formulas in hybrid polyadic modal logics
This page was built for publication: Deterministic SQEMA and application for pre-contact logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4994195)
