Admissibility of Cut in Coalgebraic Logics (bibtex)

by Dirk Pattinson and Lutz Schröder

Abstract:

We study sequent calculi for propositional modal logics, interpreted over coalgebras, with admissibility of cut being the main result. As applications we present a new proof of the (already known) interpolation property for coalition logic and establish the interpolation property for the conditional logics CK and CK+ID.

View PDF

Reference:

Dirk Pattinson and Lutz Schröder: Admissibility of Cut in Coalgebraic Logics, In J. Adamek, C. Kupke, eds.: Coalgebraic Methods in Computer Science (CMCS 08), Electronic Notes in Theoretical Computer Science, vol. 203, pp. 221–241, Elsevier; Amsterdam, 2008. [preprint]

Bibtex Entry:

@InProceedings{PattinsonSchroder08b,
  author = {Dirk Pattinson and Lutz Schr{\"o}der},
  title = {Admissibility of Cut in Coalgebraic Logics},
  year = {2008},
  editor = {J. Adamek and C. Kupke},
  booktitle = {Coalgebraic Methods in Computer Science (CMCS 08)},
  publisher = {Elsevier; Amsterdam},
  series = {Electronic Notes in Theoretical Computer Science},
  volume = {203},
  pages = {221-241},
  keywords = {Coalgebra modal logic cut elimination conditional logic coalition logic},
  url = {http://dx.doi.org/10.1016/j.entcs.2008.05.027},
  comment = { <a href = "http://www8.informatik.uni-erlangen.de/~schroeder/papers/cut.pdf"> [preprint] </a>},
  abstract = {We study sequent calculi for propositional modal logics, interpreted
over coalgebras, with admissibility of cut being the main result. As
applications we present a new proof of the (already known)
interpolation property for coalition logic and establish the
interpolation property for the conditional logics CK and
CK+ID.
},
}