Inflationary Fixed Points in Modal Logic

Authors:
Anuj Dawar;Erich Grädel;Stephan Kreutzer
Affiliations:
-;-;-
Venue:
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Year:
2001

Citing 11
Cited 2

Feasible computation through model theory

Feasible computation through model theory
Infinitary logic and inductive definability over finite structures

Information and Computation
On the complexity of bounded-variable queries (extended abstract)

PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The expressive power of finitely many generalized quantifiers

Information and Computation
Automaticity I: properties of a measure of descriptional complexity

Journal of Computer and System Sciences
Deciding the winner in parity games is in UP ∩ co-UP

Information Processing Letters
On logics with two variables

Theoretical Computer Science
Bisimulation-invariant PTIME and higher-dimensional &mgr;-calculus

Theoretical Computer Science
On the Expressive Completeness of the Propositional mu-Calculus with Respect to Monadic Second Order Logic

CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Bounded-Variable Fixpoint Queries are PSPACE-complete

CSL '96 Selected Papers from the10th International Workshop on Computer Science Logic
Inflationary fixed points in modal logic

ACM Transactions on Computational Logic (TOCL)

Generalising Automaticity to Modal Properties of Finite Structures

FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
The complexity of model checking higher order fixpoint logic

MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider an extension of modal logic with an operator for constructing inflationary fixed points, just as the modal µ-calculus extends basic modal logic with an operator for least fixed points. Least and inflationary fixed point operators have been studied and compared in other contexts, particularly in finite model theory, where it is known that the logics IFP and LFP that result from adding such fixed point operators to first order logic have equal expressive power. As we show, the situation in modal logic is quite different, as the modal iteration calculus (MIC) we introduce has much greater expressive power than the µ-calculus. Greater expressive power comes at a cost: the calculus is algorithmically much less manageable.