Proving Structural Properties of Sequent Systems in Rewriting Logic

WRLA@ETAPS, pp. 115-135, 2018.

Cited by: 0|Bibtex|Views2|Links
EI

Abstract:

General and effective methods are required for providing good automation strategies to prove properties of sequent systems. Structural properties such as admissibility, invertibility, and permutability of rules are crucial in proof theory, and they can be used for proving other key properties such as cut-elimination. However, finding proo...More

Code:

Data:

Your rating :
0

 

Tags
Comments