The complexity of identifying characteristic formulae
type: Item
instance of: scholarly article
title: The complexity of identifying characteristic formulae
zbMATH Open document ID: 1433.68163
author: Luca Aceto
author: Antonis Achilleos
author: Adrian Francalanza
author: Anna Ingolfsdottir
published in: Journal of Logical and Algebraic Methods in Programming
publication date: 2020-04-15T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 03B45
Mathematics Subject Classification ID: 03B70
zbMATH DE Number: 7189662
zbMATH Keywords: modal logic
zbMATH Keywords: \(\mu\)-calculus
zbMATH Keywords: Hennessy-Milner logic with recursion
zbMATH Keywords: completeness
zbMATH Keywords: characteristic formulae
zbMATH Keywords: computational complexity
MaRDI profile type: Publication
full work available at URL: j.jlamp.2020.100529
OpenAlex ID: W3008129045
cites work: Characteristic formulae for fixed-point semantics: a general framework
cites work: The completeness problem for modal logic
cites work: Parameterized modal satisfiability
cites work: Towards Syntactic Epistemic Logic
cites work: Modal logic
cites work: On the unique satisfiability problem
cites work: Q3128959
cites work: Q5465436
cites work: Bounded model checking using satisfiability solving
cites work: Q4935259
cites work: Q4845472
cites work: Normal forms in modal logic
cites work: Propositional dynamic logic of regular programs
cites work: Tableau methods of proof for modal logics
cites work: Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
cites work: A modal characterization of observational congruence on finite terms of CCS
cites work: The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic
cites work: A guide to completeness and complexity for modal logics of knowledge and belief
cites work: Characterizing the NP-PSPACE Gap in the Satisfiability Problem for Modal Logic
cites work: Algebraic laws for nondeterminism and concurrency
cites work: Results on the propositional \(\mu\)-calculus
cites work: The Computational Complexity of Provability in Systems of Modal Propositional Logic
cites work: Proof systems for satisfiability in Hennessy-Milner logic with recursion
cites work: Single step tableaux for modal logics. Computational properties, complexity and methodology
cites work: Q3992568
cites work: Finite models constructed from canonical formulas
cites work: The extensions of the modal logic K5
cites work: Three Partition Refinement Algorithms
cites work: Q4791269
cites work: Characteristic formulae for processes with divergence
cites work: An automata theoretic decision procedure for the propositional mu- calculus
cites work: Relative complexity of checking and evaluating
cites work: Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus.
DOI: 10.1016/J.JLAMP.2020.100529
description: scientific article; zbMATH DE number 7189662