no code implementations • 8 Jan 2021 • Carlos Olarte, Elaine Pimentel, Camilo Rocha
This paper develops an algorithmic-based approach for proving inductive properties of propositional sequent systems such as admissibility, invertibility, cut-elimination, and identity expansion.
Logic in Computer Science Logic
1 code implementation • 15 Apr 2019 • Carlos Olarte, Valeria de Paiva, Elaine Pimentel, Giselle Reis
In order to enhance the set of problems in our library, we apply the three provability-preserving translations to the propositional benchmarks in the ILTP Library.
Logic in Computer Science
