{"pubrep_id":"136","_id":"2243","oa":1,"series_title":"Leibniz International Proceedings in Informatics","project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989"}],"language":[{"iso":"eng"}],"title":"Elementary modal logics over transitive structures","doi":"10.4230/LIPIcs.CSL.2013.563","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","conference":{"start_date":"2013-09-02","name":"CSL: Computer Science Logic","end_date":"2013-09-05","location":"Torino, Italy"},"type":"conference","citation":{"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.","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>","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>.","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>.","ista":"Michaliszyn J, Otop J. 2013. Elementary modal logics over transitive structures. 23, 563–577.","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>"},"year":"2013","date_created":"2018-12-11T11:56:32Z","publist_id":"4708","has_accepted_license":"1","department":[{"_id":"ToHe"}],"status":"public","ec_funded":1,"author":[{"first_name":"Jakub","full_name":"Michaliszyn, Jakub","last_name":"Michaliszyn"},{"full_name":"Otop, Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","last_name":"Otop","first_name":"Jan"}],"month":"09","publication_status":"published","page":"563 - 577","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"date_published":"2013-09-01T00:00:00Z","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."}],"scopus_import":1,"alternative_title":["LIPIcs"],"intvolume":"        23","file_date_updated":"2020-07-14T12:45:34Z","oa_version":"Published Version","day":"01","volume":23,"file":[{"creator":"system","date_created":"2018-12-12T10:12:11Z","file_name":"IST-2016-136-v1+2_39.pdf","file_id":"4929","date_updated":"2020-07-14T12:45:34Z","access_level":"open_access","file_size":454915,"content_type":"application/pdf","relation":"main_file","checksum":"e0732e73a8b1e39483df7717d53e3e35"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","ddc":["000","004"],"date_updated":"2020-08-11T10:09:42Z"}