2019
DOI: 10.1145/3341725
|View full text |Cite
|
Sign up to set email alerts
|

Probabilistic Epistemic Updates on Algebras

Abstract: The present article contributes to the development of the mathematical theory of epistemic updates using the tools of duality theory. Here, we focus on Probabilistic Dynamic Epistemic Logic (PDEL). We dually characterize the product update construction of PDEL-models as a certain construction transforming the complex algebras associated with the given model into the complex algebra associated with the updated model. Thanks to this construction, an interpretation of the language of PDEL can be defined on algebr… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2019
2019
2021
2021

Publication Types

Select...
2
2

Relationship

4
0

Authors

Journals

citations
Cited by 4 publications
(4 citation statements)
references
References 36 publications
0
4
0
Order By: Relevance
“…for modelling cognitive and social development of individuals [40]), and management science (to analyze market dynamics in terms of the evolution of categories of products and producers [64]). This is presently ongoing work, based on a suitable generalization of the techniques and results on dynamic updates on algebras developed in [55,50,18,19] J c. join-generates F + i.e ∀x ∈ X R (0) [I (1) [R (0) [x ↓↑ ]]] ⊆ R (0) [x ↓↑ ] translation iff ∀x ∈ X R (0) [I (1) [R (0) J c. join-generates…”
Section: Conclusion and Further Directionsmentioning
confidence: 99%

Rough concepts

Conradie,
Frittella,
Manoorkar
et al. 2019
Preprint
Self Cite
“…for modelling cognitive and social development of individuals [40]), and management science (to analyze market dynamics in terms of the evolution of categories of products and producers [64]). This is presently ongoing work, based on a suitable generalization of the techniques and results on dynamic updates on algebras developed in [55,50,18,19] J c. join-generates F + i.e ∀x ∈ X R (0) [I (1) [R (0) [x ↓↑ ]]] ⊆ R (0) [x ↓↑ ] translation iff ∀x ∈ X R (0) [I (1) [R (0) J c. join-generates…”
Section: Conclusion and Further Directionsmentioning
confidence: 99%

Rough concepts

Conradie,
Frittella,
Manoorkar
et al. 2019
Preprint
Self Cite
“…Let A, B, e : A → B and r : B X → A X be as above. 10 Then the co-GMT translation σ satisfies conditions Extending the GMT and co-GMT translations to bi-intuitionistic logic. In the present subsection we consider the extensions of the GMT and co-GMT translations to bi-intuitionistic logic (aka Heyting-Brouwer logic according to the terminology of Rauszer [56] who introduced this logic in the same paper, see also [55,57]).…”
Section: 12mentioning
confidence: 99%
“…The paper [66] considers a modal expansion of bi-intuitionistic logic with box and diamond operators where the extended GMT translation is used to establish a Blok-Esakia result and to transfer properties such as completeness, finite model property and decidability. 10 The assumption that e is a homomorphism of the lattice reducts of A and B is needed for the inductive steps relative to ⊥, , ∧, ∨ in the proof this proposition, while condition (5.2) is needed for the step relative to > . The language of bi-intuitionistic logic is given by…”
Section: 12mentioning
confidence: 99%
See 1 more Smart Citation