On the computational complexity of cut-reduction

Aehlig, K., & Beckmann, A. (2009). On the computational complexity of cut-reduction. Annals of Pure and Applied Logic, 161(6), 711–736. https://doi.org/10.1016/j.apal.2009.06.004

Aehlig, Klaus, and Arnold Beckmann. “On the computational complexity of cut-reduction.” Annals of Pure and Applied Logic, vol. 161, no. 6, 2009, pp. 711–36, https://doi.org/10.1016/j.apal.2009.06.004.

Aehlig, Klaus, and Arnold Beckmann. 2009. “On the computational complexity of cut-reduction.” Annals of Pure and Applied Logic 161 (6): 711–36. https://doi.org/10.1016/j.apal.2009.06.004.

Aehlig, K. and Beckmann, A. (2009) ‘On the computational complexity of cut-reduction’, Annals of Pure and Applied Logic, 161(6), pp. 711–736. Available at: https://doi.org/10.1016/j.apal.2009.06.004.

@article{aehlig2009computational,
  title = {{On the computational complexity of cut-reduction}},
  author = {Aehlig, Klaus and Beckmann, Arnold},
  journal = {Annals of Pure and Applied Logic},
  volume = {161},
  number = {6},
  pages = {711--736},
  year = {2009},
  doi = {10.1016/j.apal.2009.06.004}
}