Translating Graded Modalities into Predicate Logic.

Ohlbach, H. J., Schmidt, R. A., and Hustadt, U. (1996)

In H. Wansing (ed), Proof Theory for Modal Logic, Applied Logic Series 2, Kluwer, 253-291. BiBTeX, PostScript.

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. Our translation is sound and complete.

Also available as Tech. Rep. MPI-I-95-2-008, MPI für Informatik, Saarbrücken, Germany (May 1995). PostScript
Renate A. Schmidt
Home | Publications | FM Group | School | Man Univ

Last modified: 27 Apr 2001
Copyright © 1996,7,8 Renate A. Schmidt, School of Computer Science, Man Univ,