Record link: 
http://hdl.handle.net/20.500.12708/58033
-
Title: 
Countermodel Construction via Optimal Hypersequent Calculi for Non-normal Modal Logics
en
Citation: 
Dalmonte, T., Lellmann, B., Olivetti, N., & Pimentel, E. (2016). Countermodel Construction via Optimal Hypersequent Calculi for Non-normal Modal Logics. In S. Artemov & A. Nerode (Eds.), Logical Foundations of Computer Science. International Symposium, LFCS 2016 (pp. 27–46). Springer. https://doi.org/10.1007/978-3-030-36755-8_3
-
Publisher DOI: 
10.1007/978-3-030-36755-8_3
-
Publication Type: 
Inproceedings - Full-Paper Contribution
en
Language: 
English
-
Authors: 
Dalmonte, Tiziano 
Lellmann, Björn 
Olivetti, Nicola 
Pimentel, Elaine 
-
Organisational Unit: 
E104 - Institut für Diskrete Mathematik und Geometrie 
-
Published in: 
Logical Foundations of Computer Science. International Symposium, LFCS 2016 
-
ISBN: 
978-3-319-27683-0
-
DOI of the book: 
10.1007/978-3-319-27683-0
-
Date (published): 
2016
-
Event name: 
Logical Foundations of Computer Science, International Symposium, LFCS 2016 
-
Event date: 
4-Jan-2016 - 7-Jan-2016
-
Event place: 
Deerfield Beach, Forida, United States of America (the)
-
Number of Pages: 
20
-
Publisher: 
Springer, 9537
-
Publisher: 
Springer
-
Peer reviewed: 
Yes
-
Keywords: 
Cut elimination; Hypersequents; Non-normal modal logics; Countermodel construction
-
Abstract: 
We develop semantically-oriented calculi for the cube of non-normal modal logics and some deontic extensions. The calculi manipulate hypersequents and have a simple semantic interpretation. Their main feature is that they allow for direct countermodel extraction. Moreover they provide an optimal decision procedure for the respective logics. They also enjoy standard proof-theoretical properties, such as a syntactical proof of cut-admissibility.
en
Research Areas: 
Logic and Computation: 100%
-
Science Branch: 
Informatik
-
Appears in Collections:
Conference Paper

Show full item record

Page view(s)

141
checked on Dec 1, 2023

Download(s)

2
checked on Dec 1, 2023

Google ScholarTM

Check