Translating Graded Modalities into Predicate Logics. Ohlbach, H. J., Schmidt, R. A., & Hustadt, U. In Proof Theory of Modal Logic, volume 2, of Applied Logic Series, pages 253-291. Kluwer, Dordrecht, The Netherlands, 1996.
Translating Graded Modalities into Predicate Logics [link]Paper  abstract   bibtex   
In the logic of graded modalities it is possible to talk about sets of finite cardinality. Various calculi exist for graded modal logics and all generate vast amounts of case distinctions. In this paper we present an optimized translation from graded modal logic into many-sorted predicate logic. This translation has the advantage that in contrast to known approaches our calculus enables us to reason with cardinalities of sets symbolically. In many cases the length of proofs for theorems of this calculus is independent of the cardinalities. The translation is sound and complete.
@INCOLLECTION{Ohlbach+Schmidt+Hustadt@PTML1996,
 AUTHOR    = {Ohlbach, Hans J{\"u}rgen and Schmidt, Renate A. and Hustadt, Ullrich},
 YEAR      = {1996},
 TITLE     = {Translating Graded Modalities into Predicate Logics},
 EDITOR    = {Wansing, H.},
 BOOKTITLE = {Proof Theory of Modal Logic},
 SERIES    = {Applied Logic Series},
 VOLUME    = {2},
 PUBLISHER = {Kluwer},
 ADDRESS   = {Dordrecht, The Netherlands},
 PAGES     = {253-291},
 URL       = {http://dx.doi.org/10.1007/978-94-017-2798-3_14},
 ABSTRACT  = {In the logic of graded modalities it is possible to talk
  about sets of finite cardinality.  Various calculi exist for graded
  modal logics and all generate vast amounts of case distinctions.  In
  this paper we present an optimized translation from graded modal logic
  into many-sorted predicate logic.  This translation has the advantage
  that in contrast to known approaches our calculus enables us to reason
  with cardinalities of sets symbolically.  In many cases the length of
  proofs for theorems of this calculus is independent of the
  cardinalities. The translation is sound and complete.},
}

Downloads: 0