A strong induction scheme that leads to polynomially computable realizations (Q1885030): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2004.03.023
@@ Property / DOI: 10.1016/j.tcs.2004.03.023 / rank @@
-Normal rank
@@ 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/j.tcs.2004.03.023
+Normal rank
@@ Property / OpenAlex ID @@
+W2006885584
@@ Property / OpenAlex ID: W2006885584 / rank @@
+Normal rank
@@ Property / cites work @@
+On the computational power of pushdown automata
@@ Property / cites work: On the computational power of pushdown automata / rank @@
+Normal rank
@@ Property / cites work @@
+Intuitionistic formal theories with realizability in subrecursive classes
+Normal rank
@@ Property / cites work @@
+Q3800030
@@ Property / cites work: Q3800030 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5670174
@@ Property / cites work: Q5670174 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5812175
@@ Property / cites work: Q5812175 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2004.03.023
@@ Property / DOI: 10.1016/J.TCS.2004.03.023 / rank @@
+Normal rank