Towards the computational complexity of \(\mathcal{PR}^ \omega\)-terms (Q1899150): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0168-0072(94)00062-8
+Normal rank
@@ Property / OpenAlex ID @@
+W1968367799
@@ Property / OpenAlex ID: W1968367799 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4281467
@@ Property / cites work: Q4281467 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4842532
@@ Property / cites work: Q4842532 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4010352
@@ Property / cites work: Q4010352 / rank @@
+Normal rank
@@ Property / cites work @@
+Subrecursive hierarchies on Scott domains
@@ Property / cites work: Subrecursive hierarchies on Scott domains / rank @@
+Normal rank
@@ Property / cites work @@
+Q4876432
@@ Property / cites work: Q4876432 / rank @@
+Normal rank
@@ Property / cites work @@
+LCF considered as a programming language
@@ Property / cites work: LCF considered as a programming language / rank @@
+Normal rank
@@ Property / cites work @@
+Q5457388
@@ Property / cites work: Q5457388 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3959414
@@ Property / cites work: Q3959414 / rank @@
+Normal rank
@@ Property / cites work @@
+A type-theoretical alternative to ISWIM, CUCH, OWHY
+Normal rank
@@ Property / cites work @@
+Q4775862
@@ Property / cites work: Q4775862 / rank @@
+Normal rank