Proof Theory at Work: Complexity Analysis of Term Rewrite Systems
Logic in Computer Science
2009-12-30 v2 Computational Complexity
Symbolic Computation
Software Engineering
Abstract
This thesis is concerned with investigations into the "complexity of term rewriting systems". Moreover the majority of the presented work deals with the "automation" of such a complexity analysis. The aim of this introduction is to present the main ideas in an easily accessible fashion to make the result presented accessible to the general public. Necessarily some technical points are stated in an over-simplified way.
Cite
@article{arxiv.0907.5527,
title = {Proof Theory at Work: Complexity Analysis of Term Rewrite Systems},
author = {Georg Moser},
journal= {arXiv preprint arXiv:0907.5527},
year = {2009}
}
Comments
Cumulative Habilitation Thesis, submitted to the University of Innsbruck