Cut elimination in coalgebraic logics
We give two generic proofs for cut elimination in propositional modal logics, interpreted over coalgebras. We first investigate semantic coherence conditions between the axiomatisation of a particular logic and its coalgebraic semantics that guarantee tha
|Collections||ANU Research Publications|
|Source:||Information and Computation|
|01_Pattinson_Cut_elimination_in_coalgebraic_2010.pdf||412.33 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.