On the existence of closed terms in the typed lambda calculus II: Transformations of unification problems (Q1164619): Difference between revisions

@@ Property / author @@
-Richard Statman
@@ Property / author: Richard Statman / rank @@
-Normal rank
@@ Property / author @@
+Richard Statman
@@ Property / author: Richard Statman / 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/0304-3975(81)90086-4
+Normal rank
@@ Property / OpenAlex ID @@
+W2050106235
@@ Property / OpenAlex ID: W2050106235 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5565113
@@ Property / cites work: Q5565113 / rank @@
+Normal rank
@@ Property / cites work @@
+The undecidability of the second-order unification problem
+Normal rank
@@ Property / cites work @@
+Ordering by Divisibility in Abstract Algebras
@@ Property / cites work: Ordering by Divisibility in Abstract Algebras / rank @@
+Normal rank
@@ Property / cites work @@
+Q4133944
@@ Property / cites work: Q4133944 / rank @@
+Normal rank
@@ Property / cites work @@
+Intuitionistic propositional logic is polynomial-space complete
+Normal rank
@@ Property / cites work @@
+The typed lambda-calculus is not elementary recursive
+Normal rank
@@ Property / cites work @@
+Completeness, invariance and <i>λ</i>-definability
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1164619