Verifying the Modal Logic Cube is an Easy Task (for Higher-Order Automated Reasoners)

Benzmüller, Christoph

doi:10.1007/978-3-642-17172-7_7

by Christoph Benzmüller

Reference:

Verifying the Modal Logic Cube is an Easy Task (for Higher-Order Automated Reasoners) (Christoph Benzmüller), Chapter in Verification, Induction, Termination Analysis - Festschrift for Christoph Walther on the Occasion of His 60th Birthday (Simon Siegler, Nathan Wasser, eds.), Springer, LNCS, volume 6463, pp. 117-128, 2010. (Url (preprint): http://christoph-benzmueller.de/papers/B12.pdf)

Bibtex Entry:

@incollection{B12,
  Author =	 {Christoph Benzm\"uller},
  Booktitle =	 {Verification, Induction, Termination Analysis -
                  Festschrift for Christoph Walther on the Occasion of
                  His 60th Birthday},
  Doi =		 {10.1007/978-3-642-17172-7_7},
  Editor =	 {Simon Siegler and Nathan Wasser},
  Keywords =	 {own, Modal Logics, Semantic Embedding, Higher Order
                  Logic, Automated Reasoning, LEO Prover},
  Note =	 {(Superseded by PxTP-2015 paper)},
  Pages =	 {117-128},
  Publisher =	 {Springer},
  Series =	 {LNCS},
  Title =	 {Verifying the Modal Logic Cube is an Easy Task (for
                  Higher-Order Automated Reasoners)},
  Note =	 {Url (preprint):
                  \url{http://christoph-benzmueller.de/papers/B12.pdf}},
  Volume =	 6463,
  Year =	 2010,
}