{"title":"Elementary modal logics over transitive structures","month":"09","_id":"2243","doi":"10.4230/LIPIcs.CSL.2013.563","citation":{"ama":"Michaliszyn J, Otop J. Elementary modal logics over transitive structures. 2013;23:563-577. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.563\">10.4230/LIPIcs.CSL.2013.563</a>","ista":"Michaliszyn J, Otop J. 2013. Elementary modal logics over transitive structures. 23, 563–577.","mla":"Michaliszyn, Jakub, and Jan Otop. <i>Elementary Modal Logics over Transitive Structures</i>. Vol. 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 563–77, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.563\">10.4230/LIPIcs.CSL.2013.563</a>.","ieee":"J. Michaliszyn and J. Otop, “Elementary modal logics over transitive structures,” vol. 23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 563–577, 2013.","chicago":"Michaliszyn, Jakub, and Jan Otop. “Elementary Modal Logics over Transitive Structures.” Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013. <a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.563\">https://doi.org/10.4230/LIPIcs.CSL.2013.563</a>.","short":"J. Michaliszyn, J. Otop, 23 (2013) 563–577.","apa":"Michaliszyn, J., &#38; Otop, J. (2013). Elementary modal logics over transitive structures. Presented at the CSL: Computer Science Logic, Torino, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.563\">https://doi.org/10.4230/LIPIcs.CSL.2013.563</a>"},"type":"conference","oa_version":"Published Version","series_title":"Leibniz International Proceedings in Informatics","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","oa":1,"scopus_import":1,"conference":{"end_date":"2013-09-05","start_date":"2013-09-02","location":"Torino, Italy","name":"CSL: Computer Science Logic"},"publication_status":"published","author":[{"last_name":"Michaliszyn","full_name":"Michaliszyn, Jakub","first_name":"Jakub"},{"full_name":"Otop, Jan","first_name":"Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","last_name":"Otop"}],"publist_id":"4708","file_date_updated":"2020-07-14T12:45:34Z","language":[{"iso":"eng"}],"department":[{"_id":"ToHe"}],"page":"563 - 577","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:56:32Z","alternative_title":["LIPIcs"],"date_published":"2013-09-01T00:00:00Z","year":"2013","ddc":["000","004"],"file":[{"relation":"main_file","date_updated":"2020-07-14T12:45:34Z","content_type":"application/pdf","file_name":"IST-2016-136-v1+2_39.pdf","date_created":"2018-12-12T10:12:11Z","file_size":454915,"checksum":"e0732e73a8b1e39483df7717d53e3e35","creator":"system","access_level":"open_access","file_id":"4929"}],"has_accepted_license":"1","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF"},{"call_identifier":"FP7","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling"}],"volume":23,"pubrep_id":"136","ec_funded":1,"status":"public","abstract":[{"lang":"eng","text":"We show that modal logic over universally first-order definable classes of transitive frames is decidable. More precisely, let K be an arbitrary class of transitive Kripke frames definable by a universal first-order sentence. We show that the global and finite global satisfiability problems of modal logic over K are decidable in NP, regardless of choice of K. We also show that the local satisfiability and the finite local satisfiability problems of modal logic over K are decidable in NEXPTIME."}],"intvolume":"        23","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"date_updated":"2020-08-11T10:09:42Z","quality_controlled":"1","day":"01"}