Algorithmic correspondence for intuitionistic modal mu-calculus
type: Item
instance of: scholarly article
title: Algorithmic correspondence for intuitionistic modal mu-calculus
zbMATH Open document ID: 1318.03030
author: Willem Conradie
author: Alessandra Palmigiano
author: Sumit Sourabh
author: Yves Baudelaire Fomatati
published in: Theoretical Computer Science
publication date: 2014-12-16T00:00:00Z
Mathematics Subject Classification ID: 03B45
Mathematics Subject Classification ID: 03B70
zbMATH DE Number: 6380849
zbMATH Keywords: Sahlqvist correspondence
zbMATH Keywords: algorithmic correspondence
zbMATH Keywords: modal mu-calculus
zbMATH Keywords: intuitionistic logic
describes a project that uses: SQEMA
MaRDI profile type: Publication
full work available at URL: j.tcs.2014.10.027
OpenAlex ID: W2041784286
cites work: Modal logic
cites work: Q3934450
cites work: Unified Correspondence
cites work: Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA
cites work: Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA
cites work: Algorithmic correspondence and canonicity for distributive modal logic
cites work: Algebraic modal correspondence: Sahlqvist and beyond
cites work: Q4530231
cites work: Q4850061
cites work: A Sahlqvist theorem for distributive modal logic
cites work: Cut-elimination and proof search for bi-intuitionistic tense logic
cites work: Results on the propositional \(\mu\)-calculus
cites work: Q3884093
cites work: Duality and canonical extensions of bounded distributive lattices with operators, and applications to the semantics of non-classical logics. I
cites work: Q4789452
cites work: Minimal predicates, fixed-points, and definability
cites work: Sahlqvist correspondence for modal mu-calculus
DOI: 10.1016/J.TCS.2014.10.027
description: scientific article; zbMATH DE number 6380849