Bisimulation-invariant PTIME and higher-dimensional \(\mu\)-calculus
type: Item
instance of: scholarly article
title: Bisimulation-invariant PTIME and higher-dimensional \(\mu\)-calculus
zbMATH Open document ID: 0930.03030
DOI: 10.1016/S0304-3975(98)00314-4
author: Martin Otto
published in: Theoretical Computer Science
publication date: 2000-01-12T00:00:00Z
Mathematics Subject Classification ID: 03B70
Mathematics Subject Classification ID: 68Q19
Mathematics Subject Classification ID: 03C13
Mathematics Subject Classification ID: 03B45
Mathematics Subject Classification ID: 68Q60
zbMATH DE Number: 1387352
zbMATH Keywords: Logic in computer science
zbMATH Keywords: Finite model theory
zbMATH Keywords: Modal logic
zbMATH Keywords: Descriptive complexity
zbMATH Keywords: Process logics
zbMATH Keywords: Model checking
zbMATH Keywords: worlds in finite Kripke structures
zbMATH Keywords: states in finite transition systems
zbMATH Keywords: polynomial time
zbMATH Keywords: bisimulation equivalence
zbMATH Keywords: higher-dimensional \(\mu\)-calculus
MaRDI profile type: Publication
cites work: Deciding bisimilarity is P-complete
cites work: Interpolation, preservation, and pebble games
cites work: Q4717366
cites work: Modal correspondence for models
cites work: Q4065514
cites work: Q3781066
cites work: The undecidability of the domino problem
cites work: Q5691140
cites work: Structure and complexity of relational queries
cites work: Infinitary logic and inductive definability over finite structures
cites work: Q4850061
cites work: Q4385542
cites work: Q4283240
cites work: Undecidability results on two-variable logics
cites work: Remarks on Berger's paper on the domino problem
cites work: Fixed-point extensions of first-order logic
cites work: Recurring Dominoes: Making the Highly Undecidable Highly Understandable
cites work: Relational queries computable in polynomial time
cites work: On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic
cites work: Results on the propositional \(\mu\)-calculus
cites work: A finite model theorem for the propositional \(\mu\)-calculus
cites work: Q3677736
cites work: A calculus of communicating systems
cites work: The expressive power of fixed-point logic with counting
cites work: Canonization for two variables and puzzles on the square
cites work: Q4332930
cites work: Bounded variable logics: Two, three, and more
cites work: Q3907077
cites work: Q4376058
cites work: An automata theoretic decision procedure for the propositional mu- calculus
full work available at URL: s0304-3975(98)00314-4
OpenAlex ID: W1981996395
description: scientific article; zbMATH DE number 1387352