Translating Graded Modalities into Predicate Logic. Ohlbach, H. J., Schmidt, R. A., & Hustadt, U. Technical Report MPI-I-95-2-008, Max-Planck-Institut für Informatik, Saarbrücken, 1995. Also appeared in H. Wansing, editor, Proof Theory of Modal Logic, Kluwer, 1996.
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.
@TECHREPORT{Ohlbach+Schmidt+Hustadt@MPII-TR1995.pdf,
AUTHOR = {Ohlbach, Hans J{\"u}rgen and Schmidt, Renate A. and
Hustadt, Ullrich},
YEAR = {1995},
TITLE = {Translating Graded Modalities into Predicate Logic},
TYPE = {Technical Report},
NUMBER = {MPI-I-95-2-008},
INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
ADDRESS = {Saarbr{\"u}cken},
NOTE = {Also appeared in H. Wansing, editor, Proof Theory of Modal Logic,
Kluwer, 1996.},
URL = {Ohlbach+Schmidt+Hustadt@MPII-TR1995.pdf},
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
{"_id":"DbBTPp7GNgw9qKggM","bibbaseid":"ohlbach-schmidt-hustadt-translatinggradedmodalitiesintopredicatelogic-1995","author_short":["Ohlbach, H. J.","Schmidt, R. A.","Hustadt, U."],"bibdata":{"bibtype":"techreport","type":"Technical Report","author":[{"propositions":[],"lastnames":["Ohlbach"],"firstnames":["Hans","Jürgen"],"suffixes":[]},{"propositions":[],"lastnames":["Schmidt"],"firstnames":["Renate","A."],"suffixes":[]},{"propositions":[],"lastnames":["Hustadt"],"firstnames":["Ullrich"],"suffixes":[]}],"year":"1995","title":"Translating Graded Modalities into Predicate Logic","number":"MPI-I-95-2-008","institution":"Max-Planck-Institut für Informatik","address":"Saarbrücken","note":"Also appeared in H. Wansing, editor, Proof Theory of Modal Logic, Kluwer, 1996.","url":"Ohlbach+Schmidt+Hustadt@MPII-TR1995.pdf","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.","bibtex":"@TECHREPORT{Ohlbach+Schmidt+Hustadt@MPII-TR1995.pdf,\n AUTHOR = {Ohlbach, Hans J{\\\"u}rgen and Schmidt, Renate A. and \n Hustadt, Ullrich},\n YEAR = {1995},\n TITLE = {Translating Graded Modalities into Predicate Logic},\n TYPE = {Technical Report},\n NUMBER = {MPI-I-95-2-008},\n INSTITUTION = {Max-Planck-Institut f{\\\"u}r Informatik},\n ADDRESS = {Saarbr{\\\"u}cken},\n NOTE = {Also appeared in H. Wansing, editor, Proof Theory of Modal Logic, \n Kluwer, 1996.},\n URL = {Ohlbach+Schmidt+Hustadt@MPII-TR1995.pdf},\n ABSTRACT = {In the logic of graded modalities it is possible to talk\n about sets of finite cardinality. Various calculi exist for graded\n modal logics and all generate vast amounts of case distinctions. In\n this paper we present an optimized translation from graded modal logic\n into many-sorted predicate logic. This translation has the advantage\n that in contrast to known approaches our calculus enables us to reason\n with cardinalities of sets symbolically. In many cases the length of\n proofs for theorems of this calculus is independent of the\n cardinalities. The translation is sound and complete.},\n}\n","author_short":["Ohlbach, H. J.","Schmidt, R. A.","Hustadt, U."],"key":"Ohlbach+Schmidt+Hustadt@MPII-TR1995.pdf","id":"Ohlbach+Schmidt+Hustadt@MPII-TR1995.pdf","bibbaseid":"ohlbach-schmidt-hustadt-translatinggradedmodalitiesintopredicatelogic-1995","role":"author","urls":{"Paper":"http://cgi.csc.liv.ac.uk/~ullrich/publications/Ohlbach+Schmidt+Hustadt@MPII-TR1995.pdf"},"metadata":{"authorlinks":{}}},"bibtype":"techreport","biburl":"http://cgi.csc.liv.ac.uk/~ullrich/publications/all.bib?authorFirst=1","dataSources":["WhiGijHmCtTSdLaAj","FgmYE34DdKWThg2dR"],"keywords":[],"search_terms":["translating","graded","modalities","predicate","logic","ohlbach","schmidt","hustadt"],"title":"Translating Graded Modalities into Predicate Logic","year":1995}