The Descriptive Complexity of the Deterministic Exponential Time Hierarchy (Q5179012): Difference between revisions

@@ Property / cites work @@
+Q4058132
@@ Property / cites work: Q4058132 / rank @@
+Normal rank
@@ Property / cites work @@
+Expressibility of Higher Order Logics
@@ Property / cites work: Expressibility of Higher Order Logics / rank @@
+Normal rank
@@ Property / cites work @@
+Computing queries with higher-order logics
@@ Property / cites work: Computing queries with higher-order logics / rank @@
+Normal rank
@@ Property / cites work @@
+On the expressive power of database queries with intermediate types
+Normal rank
@@ Property / cites work @@
+Q4227581
@@ Property / cites work: Q4227581 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3798297
@@ Property / cites work: Q3798297 / rank @@
+Normal rank
@@ Property / cites work @@
+Descriptive characterizations of computational complexity
+Normal rank
@@ Property / cites work @@
+Q4298260
@@ Property / cites work: Q4298260 / rank @@
+Normal rank
@@ Property / cites work @@
+The polynomial-time hierarchy
@@ Property / cites work: The polynomial-time hierarchy / rank @@
+Normal rank
@@ Property / cites work @@
+A lattice-theoretical fixpoint theorem and its applications
+Normal rank