Translating Graded Modalities into Predicate Logics. Ohlbach, Jürgen, H., 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. 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{ OhlbachSchmidtHustadt96,
author = {Ohlbach, Hans Jü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},
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":{"_str":"52015029d40bcbb0410008d7"},"__v":0,"authorIDs":[],"author_short":["Ohlbach","Jürgen, H.","Schmidt, R.<nbsp>A.","Hustadt, U."],"bibbaseid":"-jrgen-schmidt-hustadt-translatinggradedmodalitiesintopredicatelogics-1996","bibdata":{"html":"<div class=\"bibbase_paper\">\n\n\n<span class=\"bibbase_paper_titleauthoryear\">\n\t<span class=\"bibbase_paper_title\"><a name=\"OhlbachSchmidtHustadt96\"> </a>Translating Graded Modalities into Predicate Logics.</span>\n\t<span class=\"bibbase_paper_author\">\nOhlbach; Jürgen, H.; Schmidt, R. A.; and Hustadt, U.</span>\n\t<!-- <span class=\"bibbase_paper_year\">1996</span>. -->\n</span>\n\nIn\nWansing, H., editor, <i>Proof Theory of Modal Logic</i>, volume 2, of Applied Logic Series, page 253--291.\nKluwer, Dordrecht, The Netherlands, 1996.\n\n\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content\">\n \n \n \n <a href=\"javascript:showBib('OhlbachSchmidtHustadt96')\">\n <img src=\"http://www.bibbase.org/img/filetypes/bib.png\" \n\t alt=\"Translating Graded Modalities into Predicate Logics [bib]\" \n\t class=\"bibbase_icon\"\n\t style=\"width: 24px; height: 24px; border: 0px; vertical-align: text-top\"><span class=\"bibbase_icon_text\">Bibtex</span></a>\n \n \n\n \n \n \n \n \n <span class=\"bibbase_amazon\">\n <a href=\"http://www.amazon.com/s/?url=search-alias=aps&field-keywords=Proof Theory of Modal Logic&tag=bib0d-20&link_code=wql&_encoding=UTF-8\" \n target=\"_blank\">\n Buy\n </a>\n </span>\n \n\n \n <a class=\"bibbase_abstract_link\" href=\"javascript:showAbstract('OhlbachSchmidtHustadt96')\">Abstract</a>\n \n \n</span>\n\n<!-- -->\n<!-- <div id=\"abstract_OhlbachSchmidtHustadt96\"> -->\n<!-- 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. -->\n<!-- </div> -->\n<!-- -->\n\n</div>\n","downloads":0,"bibbaseid":"-jrgen-schmidt-hustadt-translatinggradedmodalitiesintopredicatelogics-1996","urls":{},"role":"author","year":"1996","volume":"2","type":"incollection","title":"Translating Graded Modalities into Predicate Logics","series":"Applied Logic Series","publisher":"Kluwer","pages":"253--291","key":"OhlbachSchmidtHustadt96","id":"OhlbachSchmidtHustadt96","editor_short":["Wansing, H."],"editor":["Wansing, H."],"booktitle":"Proof Theory of Modal Logic","bibtype":"incollection","bibtex":"@incollection{ OhlbachSchmidtHustadt96,\n author = {Ohlbach, Hans Jürgen and Schmidt, Renate A. and Hustadt, Ullrich},\n year = {1996},\n title = {Translating Graded Modalities into Predicate Logics},\n editor = {Wansing, H.},\n booktitle = {Proof Theory of Modal Logic},\n series = {Applied Logic Series},\n volume = {2},\n publisher = {Kluwer},\n address = {Dordrecht, The Netherlands},\n pages = {253--291},\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}","author_short":["Ohlbach","Jürgen, H.","Schmidt, R.<nbsp>A.","Hustadt, U."],"author":["Ohlbach","Jürgen, Hans","Schmidt, Renate A.","Hustadt, Ullrich"],"address":"Dordrecht, The Netherlands","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."},"bibtype":"incollection","biburl":"http://www.csc.liv.ac.uk/~ullrich/publications/uh-2013-08-06.bib","downloads":0,"title":"Translating Graded Modalities into Predicate Logics","year":1996,"dataSources":["p6py5bqMdg7vzjQS3"]}