Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA
type: Item
instance of: scholarly article
title: Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA
zbMATH Open document ID: 1214.03011
author: Willem Conradie
author: Valentin Goranko
author: Dimiter Vakarelov
published in: Journal of Applied Logic
publication date: 2011-03-22T00:00:00Z
Mathematics Subject Classification ID: 03B35
Mathematics Subject Classification ID: 03B45
zbMATH DE Number: 5869144
zbMATH Keywords: modal logic
zbMATH Keywords: correspondence theory
zbMATH Keywords: canonicity
zbMATH Keywords: first-order logic with fixed-points
zbMATH Keywords: SQEMA
describes a project that uses: SQEMA
MaRDI profile type: Publication
full work available at URL: j.jal.2010.08.002
OpenAlex ID: W1987652121
cites work: Rudiments of \(\mu\)-calculus
cites work: Modal logic
cites work: Q3408862
cites work: A zero-one law for logic with a fixed-point operator
cites work: IV. Semantic extensions of SQEMA
cites work: Q5483000
cites work: Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA
cites work: Algorithmic Correspondence and Completeness in Modal Logic. II. Polyadic and Hybrid Extensions of the Algorithm SQEMA
cites work: Q5324584
cites work: Computing circumscription revisited: A reduction algorithm
cites work: Q4850061
cites work: Q3543581
cites work: The modal logic of the countable random frame
cites work: Sahlqvist formulas in hybrid polyadic modal logics
cites work: Q4430401
cites work: Elementary canonical formulae: extending Sahlqvist's theorem
cites work: Elements of finite model theory.
cites work: Q4081211
cites work: Q4539599
cites work: Q5311052
cites work: Q4342096
cites work: Minimal predicates, fixed-points, and definability
cites work: Modal frame correspondences and fixed-points
DOI: 10.1016/J.JAL.2010.08.002
description: scientific article; zbMATH DE number 5869144