Translating Graded Modalities into Predicate Logic

Ohlbach, Hans Jürgen; Schmidt, Renate A.; Hustadt, Ullrich

Datensatz

DATENSATZ AKTIONENEXPORT

Zur Ablage hinzufügen

Lokale TagsFreigabegeschichteDetailsÜbersicht

Freigegeben

Buchkapitel

Translating Graded Modalities into Predicate Logic

MPG-Autoren

/persons/resource/persons45140

Ohlbach, Hans Jürgen
Programming Logics, MPI for Informatics, Max Planck Society;

/persons/resource/persons45401

Schmidt, Renate A.
Programming Logics, MPI for Informatics, Max Planck Society;

/persons/resource/persons44660

Hustadt, Ullrich
Programming Logics, MPI for Informatics, Max Planck Society;

Externe Ressourcen

Es sind keine externen Ressourcen hinterlegt

Volltexte (beschränkter Zugriff)

Für Ihren IP-Bereich sind aktuell keine Volltexte freigegeben.

Volltexte (frei zugänglich)

Es sind keine frei zugänglichen Volltexte in PuRe verfügbar

Ergänzendes Material (frei zugänglich)

Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar

Zitation

Ohlbach, H. J., Schmidt, R. A., & Hustadt, U. (1996). Translating Graded Modalities into Predicate Logic. In H. Wansing (Ed.), Proof Theory of Modal Logic (pp. 253-291). Dordrecht, The Netherlands: Kluwer.

Zitierlink: https://hdl.handle.net/11858/00-001M-0000-0014-AC23-6

Zusammenfassung

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.