Star-free picture expressions are strictly weaker than first-order logic (Q4571966): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-63165-8_191
+Normal rank
@@ Property / OpenAlex ID @@
+W1535331541
@@ Property / OpenAlex ID: W1535331541 / rank @@
+Normal rank
@@ Property / cites work @@
+Weak Second‐Order Arithmetic and Finite Automata
+Normal rank
@@ Property / cites work @@
+Q3220545
@@ Property / cites work: Q3220545 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4874662
@@ Property / cites work: Q4874662 / rank @@
+Normal rank
@@ Property / cites work @@
+Monadic second-order logic over rectangular pictures and recognizability by tiling systems
+Normal rank
@@ Property / cites work @@
+Definability with bounded number of bound variables
+Normal rank
@@ Property / cites work @@
+Using string languages to describe picture languages
+Normal rank
@@ Property / cites work @@
+Q5641083
@@ Property / cites work: Q5641083 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3785956
@@ Property / cites work: Q3785956 / rank @@
+Normal rank