Using Program Schemes to Capture Polynomial-Time Logically on Certain Classes of Structures (Q4827608): Difference between revisions

@@ Property / cites work @@
+Finite Model Theory
@@ Property / cites work: Finite Model Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
+Normal rank
@@ Property / cites work @@
+Hierarchies in classes of program schemes
@@ Property / cites work: Hierarchies in classes of program schemes / rank @@
+Normal rank
@@ Property / cites work @@
+Program schemes, arrays, Lindström quantifiers and zero-one laws
+Normal rank
@@ Property / cites work @@
+Reachability and the power of local ordering
@@ Property / cites work: Reachability and the power of local ordering / rank @@
+Normal rank
@@ Property / cites work @@
+Logical and schematic characterization of complexity classes
+Normal rank
@@ Property / cites work @@
+Logical Description of Monotone NP Problems
@@ Property / cites work: Logical Description of Monotone NP Problems / rank @@
+Normal rank