Characterization of Logics over Ranked Tree Languages (Q3540193): 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/978-3-540-87531-4_29
+Normal rank
@@ Property / OpenAlex ID @@
+W1602811654
@@ Property / OpenAlex ID: W1602811654 / rank @@
+Normal rank
@@ Property / cites work @@
+STACS 2005
@@ Property / cites work: STACS 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Tree Languages Defined in First-Order Logic with One Quantifier Alternation
+Normal rank
@@ Property / cites work @@
+Characterizing EF and EX tree logics
@@ Property / cites work: Characterizing EF and EX tree logics / rank @@
+Normal rank
@@ Property / cites work @@
+Q3086921
@@ Property / cites work: Q3086921 / rank @@
+Normal rank
@@ Property / cites work @@
+First-order logic with two variables and unary temporal logic
+Normal rank
@@ Property / cites work @@
+Piecewise testable tree languages
@@ Property / cites work: Piecewise testable tree languages / rank @@
+Normal rank
@@ Property / cites work @@
+Q5641083
@@ Property / cites work: Q5641083 / rank @@
+Normal rank
@@ Property / cites work @@
+On finite monoids having only trivial subgroups
@@ Property / cites work: On finite monoids having only trivial subgroups / rank @@
+Normal rank
@@ Property / cites work @@
+Q4542541
@@ Property / cites work: Q4542541 / rank @@
+Normal rank
@@ Property / cites work @@
+An algebraic characterization of frontier testable tree languages
+Normal rank