From Abstract Rewriting Systems to Abstract Proof Systems
Logic in Computer Science
2013-02-26 v2 Symbolic Computation
Abstract
Some personal recollections on the introduction of `abstract proof systems' as a framework for formulating syntax-independent, general results about rule derivability and admissibility. With a particular eye on the inspiration I owe to Roel de Vrijer: the analogy with abstract rewriting systems.
Cite
@article{arxiv.0911.1412,
title = {From Abstract Rewriting Systems to Abstract Proof Systems},
author = {Clemens Grabmayer},
journal= {arXiv preprint arXiv:0911.1412},
year = {2013}
}
Comments
15 pages, 3 figures