The<i>μ</i>-calculus alternation-depth hierarchy is strict on binary trees (Q4943546): Difference between revisions

@@ Property / cites work @@
+Logical definability of fixed points
@@ Property / cites work: Logical definability of fixed points / rank @@
+Normal rank
@@ Property / cites work @@
+Q3900995
@@ Property / cites work: Q3900995 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5753528
@@ Property / cites work: Q5753528 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4273664
@@ Property / cites work: Q4273664 / rank @@
+Normal rank
@@ Property / cites work @@
+Fixpoint alternation: arithmetic, transition systems, and the binary tree
+Normal rank
@@ Property / cites work @@
+Q4381381
@@ Property / cites work: Q4381381 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4818826
@@ Property / cites work: Q4818826 / rank @@
+Normal rank
@@ Property / cites work @@
+Hierarchies of weak automata and weak monadic formulas
+Normal rank
@@ Property / cites work @@
+Alternating automata, the weak monadic theory of trees and its complexity
+Normal rank
@@ Property / cites work @@
+Alternating automata on infinite trees
@@ Property / cites work: Alternating automata on infinite trees / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed point characterization of infinite behavior of finite-state systems
+Normal rank
@@ Property / cites work @@
+Q3967525
@@ Property / cites work: Q3967525 / rank @@
+Normal rank
@@ Property / cites work @@
+Monadic second order logic on tree-like structures
+Normal rank