Locality and modular Ehrenfeucht-Fraïssé games (Q420850): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jal.2011.09.002
+Normal rank
@@ Property / OpenAlex ID @@
+W1966961526
@@ Property / OpenAlex ID: W1966961526 / rank @@
+Normal rank
@@ Property / cites work @@
+Computer Science Logic
@@ Property / cites work: Computer Science Logic / rank @@
+Normal rank
@@ Property / cites work @@
+On winning strategies in Ehrenfeucht-Fraïssé games
+Normal rank
@@ Property / cites work @@
+A model-theoretic characterisation of clique width
+Normal rank
@@ Property / cites work @@
+Clique-width of countable graphs: A compactness property.
+Normal rank
@@ Property / cites work @@
+Q4850061
@@ Property / cites work: Q4850061 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4353557
@@ Property / cites work: Q4353557 / rank @@
+Normal rank
@@ Property / cites work @@
+On monadic NP vs monadic co-NP
@@ Property / cites work: On monadic NP vs monadic co-NP / rank @@
+Normal rank
@@ Property / cites work @@
+The computational complexity of logical theories
@@ Property / cites work: The computational complexity of logical theories / rank @@
+Normal rank
@@ Property / cites work @@
+Q3666827
@@ Property / cites work: Q3666827 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5551141
@@ Property / cites work: Q5551141 / rank @@
+Normal rank
@@ Property / cites work @@
+The first order definability of graphs: Upper bounds for quantifier depth
+Normal rank
@@ Property / cites work @@
+On winning Ehrenfeucht games and monadic NP
@@ Property / cites work: On winning Ehrenfeucht games and monadic NP / rank @@
+Normal rank