Fixpoint alternation: arithmetic, transition systems, and the binary tree
RAIRO-Theor. Inf. Appl., 33 4-5 (1999) 341-356
Published online: 2002-08-15
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
The Descriptive Complexity of Modal μ Model-checking Games
Karoliina LehtinenElectronic Proceedings in Theoretical Computer Science 256 76 (2017)
https://doi.org/10.4204/EPTCS.256.6
The Arity Hierarchy in the Polyadic μ-Calculus
Martin LangeElectronic Proceedings in Theoretical Computer Science 191 105 (2015)
https://doi.org/10.4204/EPTCS.191.10
The μ-calculus alternation hierarchy collapses over structures with restricted connectivity
Julian Gutierrez, Felix Klaedtke and Martin LangeTheoretical Computer Science 560 292 (2014)
https://doi.org/10.1016/j.tcs.2014.03.027
The μ-Calculus Alternation Hierarchy Collapses over Structures with Restricted Connectivity
Julian Gutierrez, Felix Klaedtke and Martin LangeElectronic Proceedings in Theoretical Computer Science 96 113 (2012)
https://doi.org/10.4204/EPTCS.96.9
Unambiguous Tree Languages Are Topologically Harder Than Deterministic Ones
Szczepan HummelElectronic Proceedings in Theoretical Computer Science 96 247 (2012)
https://doi.org/10.4204/EPTCS.96.19
Inf-datalog, Modal Logic and Complexities
Eugénie Foustoucos and Irène GuessarianRAIRO - Theoretical Informatics and Applications 43 (1) 1 (2009)
https://doi.org/10.1051/ita:2007043
Handbook of Modal Logic
Julian Bradfield and Colin StirlingStudies in Logic and Practical Reasoning, Handbook of Modal Logic 3 721 (2007)
https://doi.org/10.1016/S1570-2464(07)80015-2
On the universal and existential fragments of the μ-calculus
Thomas A. Henzinger, Orna Kupferman and Rupak MajumdarTheoretical Computer Science 354 (2) 173 (2006)
https://doi.org/10.1016/j.tcs.2005.11.015
Automating the analysis of design component contracts
Jing Dong, Paulo S. C. Alencar and Donald D. CowanSoftware: Practice and Experience 36 (1) 27 (2006)
https://doi.org/10.1002/spe.681
The alternation hierarchy in fixpoint logic with chop is strict too
Martin LangeInformation and Computation 204 (9) 1346 (2006)
https://doi.org/10.1016/j.ic.2006.05.001
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
Igor WalukiewiczLecture Notes in Computer Science, FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science 3821 79 (2005)
https://doi.org/10.1007/11590156_5
Computer Science Logic
Julian Bradfield and Stephan KreutzerLecture Notes in Computer Science, Computer Science Logic 3634 355 (2005)
https://doi.org/10.1007/11538363_25
On temporal logic versus datalog
Irène Guessarian, Eugénie Foustoucos, Theodore Andronikos and Foto AfratiTheoretical Computer Science 303 (1) 103 (2003)
https://doi.org/10.1016/S0304-3975(02)00447-4
Computer Science Logic
Julian C. BradfieldLecture Notes in Computer Science, Computer Science Logic 2803 72 (2003)
https://doi.org/10.1007/978-3-540-45220-1_8
Deciding low levels of tree-automata hierarchy
Igor WalukiewiczElectronic Notes in Theoretical Computer Science 67 61 (2002)
https://doi.org/10.1016/S1571-0661(04)80541-3
Rudiments of μ-Calculus
Studies in Logic and the Foundations of Mathematics, Rudiments of μ-Calculus 146 269 (2001)https://doi.org/10.1016/S0049-237X(01)80013-6
Computer Science Logic
J. C. BradfieldLecture Notes in Computer Science, Computer Science Logic 1862 247 (2000)
https://doi.org/10.1007/3-540-44622-2_16