On the complexity of decision using destinies in \(H\)-bounded structures (Q1885032): Difference between revisions

@@ Property / cites work @@
+Q4781602
@@ Property / cites work: Q4781602 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5691140
@@ Property / cites work: Q5691140 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4850061
@@ Property / cites work: Q4850061 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4298571
@@ Property / cites work: Q4298571 / 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 @@
+Modest theory of short chains. I
@@ Property / cites work: Modest theory of short chains. I / rank @@
+Normal rank
@@ Property / cites work @@
+Q5572332
@@ Property / cites work: Q5572332 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3992465
@@ Property / cites work: Q3992465 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3949037
@@ Property / cites work: Q3949037 / rank @@
+Normal rank
@@ Property / cites work @@
+On direct products of theories
@@ Property / cites work: On direct products of theories / rank @@
+Normal rank
@@ Property / cites work @@
+The monadic theory of order
@@ Property / cites work: The monadic theory of order / rank @@
+Normal rank
@@ Property / cites work @@
+Q4362730
@@ Property / cites work: Q4362730 / rank @@
+Normal rank
@@ Property / cites work @@
+On Computable Numbers, with an Application to the Entscheidungsproblem
+Normal rank