Upper and lower bounds for first order expressibility (Q1173404): 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.1016/0022-0000(82)90011-3
+Normal rank
@@ Property / OpenAlex ID @@
+W1984581643
@@ Property / OpenAlex ID: W1984581643 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4091421
@@ Property / cites work: Q4091421 / rank @@
+Normal rank
@@ Property / cites work @@
+Properties of almost all graphs and complexes
@@ Property / cites work: Properties of almost all graphs and complexes / rank @@
+Normal rank
@@ Property / cites work @@
+An application of games to the completeness problem for formalized theories
+Normal rank
@@ Property / cites work @@
+Q4052071
@@ Property / cites work: Q4052071 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4058132
@@ Property / cites work: Q4058132 / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilities on finite models
@@ Property / cites work: Probabilities on finite models / rank @@
+Normal rank
@@ Property / cites work @@
+Q4082296
@@ Property / cites work: Q4082296 / rank @@
+Normal rank
@@ Property / cites work @@
+Number of quantifiers is better than number of tape cells
+Normal rank
@@ Property / cites work @@
+Almost sure theories
@@ Property / cites work: Almost sure theories / rank @@
+Normal rank
@@ Property / cites work @@
+Maze recognizing automata and nondeterministic tape complexity
+Normal rank
@@ Property / cites work @@
+On the Tape Complexity of Deterministic Context-Free Languages
+Normal rank