On the public citation graph
Simplifying the modal mu-calculus alternation hierarchy
0 signed · 42 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-16066-3_15openalex-snapshot
Regular expressions for infinite trees and a standard form of automata
inferredcites →https://doi.org/10.1007/3-540-60922-9_33openalex-snapshot
Monadic second order logic on tree-like structures
inferredcites →https://doi.org/10.1007/978-1-4684-6819-9openalex-snapshot
Verifying Temporal Properties of Systems
inferredcites →https://doi.org/10.1016/0304-3975(82)90125-6openalex-snapshot
Results on the propositional μ-calculus
inferredcites →https://doi.org/10.1016/s0304-3975(97)00217-xopenalex-snapshot
The modal mu-calculus alternation hierarchy is strict
inferredcites →https://doi.org/10.1093/oso/9780198532132.001.0001openalex-snapshot
Models of Peano Arithmetic
inferredcites →https://doi.org/10.1093/oso/9780198537618.003.0005openalex-snapshot
Modal and Temporal Logics
inferredcites →https://doi.org/10.1109/sfcs.1991.185392openalex-snapshot
Tree automata, mu-calculus and determinacy
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-45793-3_3openalex-snapshot
μ-Calculus via Games (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-031-15298-6_13openalex-snapshot
The Alternation Hierarchy of the $$\mu $$-calculus over Weakly Transitive Frames
inferred← citeshttps://doi.org/10.1007/978-3-642-03092-5_5openalex-snapshot
A Playful Glance at Hierarchical Questions for Two-Way Alternating Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-04027-6_18openalex-snapshot
Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-18090-3_16openalex-snapshot
Logiken auf unendlichen Bäumen
inferred← citeshttps://doi.org/10.1007/978-3-642-29485-3_11openalex-snapshot
On Topological Completeness of Regular Tree Languages
inferred← citeshttps://doi.org/10.1007/978-3-662-52947-8openalex-snapshot
Descriptive Set Theoretic Methods in Automata Theory Decidability and Topological Complexity
inferred← citeshttps://doi.org/10.1007/978-3-662-52947-8_5openalex-snapshot
Index Problems for Game Automata
inferred← citeshttps://doi.org/10.1007/978-3-662-53132-7_26openalex-snapshot
Unambiguous Büchi Is Weak
inferred← citeshttps://doi.org/10.1007/s00224-013-9461-4openalex-snapshot
On the Separation Question for Tree Languages
inferred← citeshttps://doi.org/10.1016/b978-044482830-9/50022-9openalex-snapshot
Modal Logics and mu-Calculi: An Introduction
inferred← citeshttps://doi.org/10.1016/j.ic.2006.05.001openalex-snapshot
The alternation hierarchy in fixpoint logic with chop is strict too
inferred← citeshttps://doi.org/10.1017/s0960129500003194openalex-snapshot
Mu-depth 3 is more than 2: a game-theoretic proof
inferred← citeshttps://doi.org/10.1051/ita:1999121openalex-snapshot
Theμ-calculus alternation-depth hierarchy is strict on binary trees
inferred← citeshttps://doi.org/10.1051/ita:1999122openalex-snapshot
Fixpoint alternation: arithmetic, transition systems, and the binary tree
inferred← citeshttps://doi.org/10.1109/lics.2013.56openalex-snapshot
Rabin-Mostowski Index Problem: A Step beyond Deterministic Automata
inferred← citeshttps://doi.org/10.18154/rwth-conv-121030openalex-snapshot
Pure and applied fixed point logics
inferred← citeshttps://doi.org/10.36045/bbms/1102714178openalex-snapshot
Alternating tree automata, parity games, and modal {$\mu$}-calculus
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2018.140openalex-snapshot
Unambiguous Languages Exhaust the Index Hierarchy
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2009.1849openalex-snapshot
On the Borel Inseparability of Game Tree Languages
inferred← citeshttps://doi.org/10.46298/theoretics.24.12openalex-snapshot
From Muller to Parity and Rabin Automata: Optimal Transformations Preserving (History) Determinism
inferred← citeshttps://doi.org/10.70675/660020c0z10a3z4b40zac0ez5871de2a15ecopenalex-snapshot
Structural properties of automata over infinite words and memory for games
inferred← citeshttps://doi.org/10.70675/ab8c4538zf338z4b1dzb5c4z539a6179abc8openalex-snapshot
A study on the expressive power of some fragments of the modal µ-calculus
inferred← citeshttps://doi.org/10.70930/tac/mhxqkgguopenalex-snapshot
The alternation hierarchy for the theory of μ-lattices
inferred← citeshttps://doi.org/10.7146/brics.v5i53.19499openalex-snapshot
Fixpoint Alternation: Arithmetic, Transition Systems, and the Binary Tree
inferred← citeshttps://doi.org/10.7146/brics.v7i29.20163openalex-snapshot
The Alternation Hierarchy for the Theory of mu-lattices
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.