From Abstract Rewriting Systems to Abstract Proof Systems

2009/11/07 by Clemens Grabmayer, Grabmayer, Clemens
Computer Science · #FOS: Computer and information sciences #Formal Methods in Verification #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #Symbolic Computation (cs.SC)

paper · pdf · doi:10.48550/arxiv.0911.1412

openalex publication_date 2009/11/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Citations

• A framework for defining logics

Related

• An Abstract Programming System
• Five Basic Concepts of Axiomatic Rewriting Theory
• Proof Theory at Work: Complexity Analysis of Term Rewrite Systems
• Axioms vs. rewrite rules: from completeness to cut elimination
• Incoherent coherences