Lukasiewicz public announcement logic
In this work we lay a theoretical framework for developing dynamic epistemic logics in a many-valued setting. We consider in particular the logic of Public Announcements, which is one of the simplest and best-known dynamic epistemic systems in the literature. We show how to develop a Public Announce...
Guardado en:
| Autores principales: | , , , , , , , , |
|---|---|
| Formato: | SER |
| Materias: | |
| Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_18650929_v611_n_p108_Cabrer |
| Aporte de: |
| id |
todo:paper_18650929_v611_n_p108_Cabrer |
|---|---|
| record_format |
dspace |
| spelling |
todo:paper_18650929_v611_n_p108_Cabrer2023-10-03T16:33:34Z Lukasiewicz public announcement logic Cabrer, L. Rivieccio, U. Rodriguez, R.O. Vieira S. Carvalho J.P. Lesot M.-J. Bouchon-Meunier B. Kaymak U. Yager R.R. Epistemic logics Lukasiewicz modal logic MV-algebras Public Announcements Logic Algebra Calculations Computer circuits Formal logic Information management Information science Knowledge based systems Reconfigurable hardware Semantics Dynamic epistemic logic Epistemic logic Hilbert-style calculus Modal logic MV-algebras Public Announcements Logic Relational semantics Theoretical framework Many valued logics In this work we lay a theoretical framework for developing dynamic epistemic logics in a many-valued setting. We consider in particular the logic of Public Announcements, which is one of the simplest and best-known dynamic epistemic systems in the literature. We show how to develop a Public Announcement Logic based on finite-valued Łukasiewicz modal logic. We define our logic through a relational semantics based on many-valued Kripke models, and also introduce an alternative but equivalent algebra-based semantics using MV-algebras endowed with modal operators. We provide a Hilbert-style calculus for our logic and prove completeness with respect to both semantics. © Springer International Publishing Switzerland 2016. SER info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by/2.5/ar http://hdl.handle.net/20.500.12110/paper_18650929_v611_n_p108_Cabrer |
| institution |
Universidad de Buenos Aires |
| institution_str |
I-28 |
| repository_str |
R-134 |
| collection |
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) |
| topic |
Epistemic logics Lukasiewicz modal logic MV-algebras Public Announcements Logic Algebra Calculations Computer circuits Formal logic Information management Information science Knowledge based systems Reconfigurable hardware Semantics Dynamic epistemic logic Epistemic logic Hilbert-style calculus Modal logic MV-algebras Public Announcements Logic Relational semantics Theoretical framework Many valued logics |
| spellingShingle |
Epistemic logics Lukasiewicz modal logic MV-algebras Public Announcements Logic Algebra Calculations Computer circuits Formal logic Information management Information science Knowledge based systems Reconfigurable hardware Semantics Dynamic epistemic logic Epistemic logic Hilbert-style calculus Modal logic MV-algebras Public Announcements Logic Relational semantics Theoretical framework Many valued logics Cabrer, L. Rivieccio, U. Rodriguez, R.O. Vieira S. Carvalho J.P. Lesot M.-J. Bouchon-Meunier B. Kaymak U. Yager R.R. Lukasiewicz public announcement logic |
| topic_facet |
Epistemic logics Lukasiewicz modal logic MV-algebras Public Announcements Logic Algebra Calculations Computer circuits Formal logic Information management Information science Knowledge based systems Reconfigurable hardware Semantics Dynamic epistemic logic Epistemic logic Hilbert-style calculus Modal logic MV-algebras Public Announcements Logic Relational semantics Theoretical framework Many valued logics |
| description |
In this work we lay a theoretical framework for developing dynamic epistemic logics in a many-valued setting. We consider in particular the logic of Public Announcements, which is one of the simplest and best-known dynamic epistemic systems in the literature. We show how to develop a Public Announcement Logic based on finite-valued Łukasiewicz modal logic. We define our logic through a relational semantics based on many-valued Kripke models, and also introduce an alternative but equivalent algebra-based semantics using MV-algebras endowed with modal operators. We provide a Hilbert-style calculus for our logic and prove completeness with respect to both semantics. © Springer International Publishing Switzerland 2016. |
| format |
SER |
| author |
Cabrer, L. Rivieccio, U. Rodriguez, R.O. Vieira S. Carvalho J.P. Lesot M.-J. Bouchon-Meunier B. Kaymak U. Yager R.R. |
| author_facet |
Cabrer, L. Rivieccio, U. Rodriguez, R.O. Vieira S. Carvalho J.P. Lesot M.-J. Bouchon-Meunier B. Kaymak U. Yager R.R. |
| author_sort |
Cabrer, L. |
| title |
Lukasiewicz public announcement logic |
| title_short |
Lukasiewicz public announcement logic |
| title_full |
Lukasiewicz public announcement logic |
| title_fullStr |
Lukasiewicz public announcement logic |
| title_full_unstemmed |
Lukasiewicz public announcement logic |
| title_sort |
lukasiewicz public announcement logic |
| url |
http://hdl.handle.net/20.500.12110/paper_18650929_v611_n_p108_Cabrer |
| work_keys_str_mv |
AT cabrerl lukasiewiczpublicannouncementlogic AT riviecciou lukasiewiczpublicannouncementlogic AT rodriguezro lukasiewiczpublicannouncementlogic AT vieiras lukasiewiczpublicannouncementlogic AT carvalhojp lukasiewiczpublicannouncementlogic AT lesotmj lukasiewiczpublicannouncementlogic AT bouchonmeunierb lukasiewiczpublicannouncementlogic AT kaymaku lukasiewiczpublicannouncementlogic AT yagerrr lukasiewiczpublicannouncementlogic |
| _version_ |
1807321245589438464 |