On the expressive power of monadic least fixed point logic (Q817849): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2005.10.025
+Normal rank
@@ Property / OpenAlex ID @@
+W1560572178
@@ Property / OpenAlex ID: W1560572178 / rank @@
+Normal rank
@@ Property / cites work @@
+The closure of monadic NP
@@ Property / cites work: The closure of monadic NP / rank @@
+Normal rank
@@ Property / cites work @@
+The modal mu-calculus alternation hierarchy is strict
+Normal rank
@@ Property / cites work @@
+A restricted second order logic for finite structures
+Normal rank
@@ Property / cites work @@
+Nonerasing, counting, and majority over the linear time hierarchy
+Normal rank
@@ Property / cites work @@
+Q4255575
@@ Property / cites work: Q4255575 / rank @@
+Normal rank
@@ Property / cites work @@
+Query evaluation via tree-decompositions
@@ Property / cites work: Query evaluation via tree-decompositions / rank @@
+Normal rank
@@ Property / cites work @@
+Monadic datalog and the expressive power of languages for Web information extraction
+Normal rank
@@ Property / cites work @@
+Model Checking Games
@@ Property / cites work: Model Checking Games / rank @@
+Normal rank
@@ Property / cites work @@
+Invariance properties of RAMs and linear time
@@ Property / cites work: Invariance properties of RAMs and linear time / rank @@
+Normal rank
@@ Property / cites work @@
+Linear Time Algorithms and NP-Complete Problems
@@ Property / cites work: Linear Time Algorithms and NP-Complete Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Sorting, linear time and the satisfiability problem
+Normal rank
@@ Property / cites work @@
+Monadic logical definability of nondeterministic linear time
+Normal rank
@@ Property / cites work @@
+Machine-Independent Characterizations and Complete Problems for Deterministic Linear Time
+Normal rank
@@ Property / cites work @@
+Q4866342
@@ Property / cites work: Q4866342 / rank @@
+Normal rank
@@ Property / cites work @@
+Comparing the succinctness of monadic query languages over finite trees
+Normal rank
@@ Property / cites work @@
+Locality of order-invariant first-order formulas
@@ Property / cites work: Locality of order-invariant first-order formulas / rank @@
+Normal rank
@@ Property / cites work @@
+Q4227581
@@ Property / cites work: Q4227581 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity classes and theories of finite models
@@ Property / cites work: Complexity classes and theories of finite models / rank @@
+Normal rank
@@ Property / cites work @@
+The quantifier structure of sentences that characterize nondeterministic time complexity
+Normal rank
@@ Property / cites work @@
+The monadic quantifier alternation hierarchy over grids and graphs
+Normal rank
@@ Property / cites work @@
+Rudimentary Languages and Second‐Order Logic
@@ Property / cites work: Rudimentary Languages and Second‐Order Logic / rank @@
+Normal rank
@@ Property / cites work @@
+Arithmetic, first-order logic, and counting quantifiers
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Q4263790
@@ Property / cites work: Q4263790 / rank @@
+Normal rank
@@ Property / cites work @@
+The polynomial-time hierarchy
@@ Property / cites work: The polynomial-time hierarchy / rank @@
+Normal rank