Fixpoint alternation: arithmetic, transition systems, and the binary tree (Q4943547): Difference between revisions

@@ Property / cites work @@
+The<i>μ</i>-calculus alternation-depth hierarchy is strict on binary trees
+Normal rank
@@ Property / cites work @@
+Q4003036
@@ Property / cites work: Q4003036 / rank @@
+Normal rank
@@ Property / cites work @@
+On the expressivity of the modal mu-calculus
@@ Property / cites work: On the expressivity of the modal mu-calculus / rank @@
+Normal rank
@@ Property / cites work @@
+The modal mu-calculus alternation hierarchy is strict
+Normal rank
@@ Property / cites work @@
+Q4381381
@@ Property / cites work: Q4381381 / rank @@
+Normal rank
@@ Property / cites work @@
+Automata for the modal μ-calculus and related results
+Normal rank
@@ Property / cites work @@
+Q4001935
@@ Property / cites work: Q4001935 / rank @@
+Normal rank
@@ Property / cites work @@
+Results on the propositional \(\mu\)-calculus
@@ Property / cites work: Results on the propositional \(\mu\)-calculus / rank @@
+Normal rank
@@ Property / cites work @@
+Q4818826
@@ Property / cites work: Q4818826 / rank @@
+Normal rank
@@ Property / cites work @@
+<i>μ</i>-definable sets of integers
@@ Property / cites work: <i>μ</i>-definable sets of integers / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed point characterization of infinite behavior of finite-state systems
+Normal rank