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...

Descripción completa

Guardado en:
Detalles Bibliográficos
Publicado: 2016
Materias:
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
Relational semantics
Theoretical framework
Many valued logics
Acceso en línea:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_18650929_v611_n_p108_Cabrer
http://hdl.handle.net/20.500.12110/paper_18650929_v611_n_p108_Cabrer
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires
id paper:paper_18650929_v611_n_p108_Cabrer
record_format dspace
spelling paper:paper_18650929_v611_n_p108_Cabrer2023-06-08T16:29:38Z Lukasiewicz public announcement logic 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. 2016 https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_18650929_v611_n_p108_Cabrer 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
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.
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
publishDate 2016
url https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_18650929_v611_n_p108_Cabrer
http://hdl.handle.net/20.500.12110/paper_18650929_v611_n_p108_Cabrer
_version_ 1768541677137428480

Ejemplares similares