The typed lambda-calculus is not elementary recursive (Q1259590): Difference between revisions

@@ 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 @@
+Q4068706
@@ Property / cites work: Q4068706 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5824357
@@ Property / cites work: Q5824357 / rank @@
+Normal rank
@@ Property / cites work @@
+A theory of prepositional types
@@ Property / cites work: A theory of prepositional types / rank @@
+Normal rank
@@ Property / cites work @@
+Q5686017
@@ Property / cites work: Q5686017 / rank @@
+Normal rank
@@ Property / cites work @@
+A unification algorithm for typed \(\overline\lambda\)-calculus
+Normal rank
@@ Property / cites work @@
+Q5619069
@@ Property / cites work: Q5619069 / rank @@
+Normal rank
@@ Property / cites work @@
+The Connection between Equivalence of Proofs and Cartesian Closed Categories
+Normal rank
@@ Property / cites work @@
+Fully abstract models of typed \(\lambda\)-calculi
+Normal rank
@@ Property / cites work @@
+Q4133967
@@ Property / cites work: Q4133967 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5559220
@@ Property / cites work: Q5559220 / rank @@
+Normal rank
@@ Property / cites work @@
+Definierbare Funktionen imλ-Kalkül mit Typen
@@ Property / cites work: Definierbare Funktionen imλ-Kalkül mit Typen / rank @@
+Normal rank
@@ Property / cites work @@
+Intuitionistic propositional logic is polynomial-space complete
+Normal rank
@@ Property / cites work @@
+Completeness, invariance and <i>λ</i>-definability
+Normal rank
@@ Property / cites work @@
+The polynomial-time hierarchy
@@ Property / cites work: The polynomial-time hierarchy / rank @@
+Normal rank
@@ Property / cites work @@
+Godel's interpretation of intuitionism
@@ Property / cites work: Godel's interpretation of intuitionism / rank @@
+Normal rank