Continuous Fragment of the mu-Calculus

Authors:
Gaëlle Fontaine
Affiliations:
Institute for Logic, Language and Computation, TV Amsterdam, The Netherlands 1018
Venue:
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Year:
2008

Citing 4
Cited 0

Domain theory

Handbook of logic in computer science (vol. 3)
Exploring logical dynamics

Exploring logical dynamics
Automata for the Modal mu-Calculus and related Results

MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
Eliminating recursion in the µ-calculus

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we investigate the Scott continuous fragment of the modal μ-calculus. We discuss its relation with constructivity, where we call a formula constructive if its least fixpoint is always reached in at most 茂戮驴steps. Our main result is a syntactic characterization of this continuous fragment. We also show that it is decidable whether a formula is continuous.