Generic Methods for formalising sequent Calculi Applied to provability logic
We describe generic methods for reasoning about multiset-based sequent calculi which allow us to combine shallow and deep embeddings as desired. Our methods are modular, permit explicit structural rules, and are widely applicable to many sequent systems,
|Collections||ANU Research Publications|
|Source:||Proceedings of International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR 2010)|
|01_Dawson_Generic_Methods_for_2010.pdf||458.73 kB||Adobe PDF||Request a copy|
|02_Dawson_Generic_Methods_for_2010.pdf||236.25 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.