On the computational complexity of cut-reduction (Q636310): 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/j.apal.2009.06.004
+Normal rank
@@ Property / OpenAlex ID @@
+W2046382802
@@ Property / OpenAlex ID: W2046382802 / rank @@
+Normal rank
@@ Property / cites work @@
+Continuous normalization for the lambda-calculus and Gödel's T
+Normal rank
@@ Property / cites work @@
+A syntactical analysis of non-size-increasing polynomial time computation
+Normal rank
@@ Property / cites work @@
+Exact bounds for lengths of reductions in typed <i>λ</i>-calculus
+Normal rank
@@ Property / cites work @@
+Dynamic ordinal analysis
@@ Property / cites work: Dynamic ordinal analysis / rank @@
+Normal rank
@@ Property / cites work @@
+Q5494228
@@ Property / cites work: Q5494228 / rank @@
+Normal rank
@@ Property / cites work @@
+An Application of Boolean Complexity to Separation Problems in Bounded Arithmetic
+Normal rank
@@ Property / cites work @@
+Notation systems for infinitary derivations
@@ Property / cites work: Notation systems for infinitary derivations / rank @@
+Normal rank
@@ Property / cites work @@
+Q4364500
@@ Property / cites work: Q4364500 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3794177
@@ Property / cites work: Q3794177 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5465358
@@ Property / cites work: Q5465358 / rank @@
+Normal rank
@@ Property / cites work @@
+Untersuchungen über das logische Schliessen. I
@@ Property / cites work: Untersuchungen über das logische Schliessen. I / rank @@
+Normal rank
@@ Property / cites work @@
+Untersuchungen über das logische Schliessen. II
@@ Property / cites work: Untersuchungen über das logische Schliessen. II / rank @@
+Normal rank
@@ Property / cites work @@
+ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
+Normal rank
@@ Property / cites work @@
+How easy is local search?
@@ Property / cites work: How easy is local search? / rank @@
+Normal rank
@@ Property / cites work @@
+Q4079564
@@ Property / cites work: Q4079564 / rank @@
+Normal rank
@@ Property / cites work @@
+Fragments of Bounded Arithmetic and Bounded Query Classes
+Normal rank
@@ Property / cites work @@
+Q4856172
@@ Property / cites work: Q4856172 / rank @@
+Normal rank
@@ Property / cites work @@
+Finite investigations of transfinite derivations
@@ Property / cites work: Finite investigations of transfinite derivations / rank @@
+Normal rank
@@ Property / cites work @@
+Structure and definability in general bounded arithmetic theories
+Normal rank
@@ Property / cites work @@
+Q3689182
@@ Property / cites work: Q3689182 / rank @@
+Normal rank
@@ Property / cites work @@
+Beweistheoretische Erfassung der unendlichen Induktion in der Zahlentheorie
+Normal rank
@@ Property / cites work @@
+Q5605873
@@ Property / cites work: Q5605873 / rank @@
+Normal rank