Quati: an automated tool for proving permutation lemmas

DOI10.1007/978-3-319-08587-6_18zbMATH Open1423.68422OpenAlexW77879984MaRDI QIDQ3192195FDOQ3192195

Authors:

Publication date: 26 September 2014

Published in: Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-08587-6_18

Recommendations

• On the generation of quantified lemmas
• Permutability of proofs in intuitionistic sequent calculi
• Tractability of cut-free Gentzen-type propositional calculus with permutation inference. II
• ProTeM: a proof term manipulator (system description)
• Tractability of cut-free Gentzen type propositional calculus with permutation inference

Mathematics Subject Classification ID

Cited In (3)

• A linear logic framework for multimodal logics
• Sequoia: A Playground for Logicians
• A rewriting logic approach to specification, proof-search, and meta-proofs in sequent systems

Uses Software

• Quati
• LaTeX

This page was built for publication: Quati: an automated tool for proving permutation lemmas

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3192195)