Do you want BuboFlash to help you learning these things? Or do you want to add or correct something? Click here to log in or create user.



Tags
#conditional-doxastic-models #doxastic-logic #logic-of-conditional-beliefs #private-announcements #public-announcements #serious-possibility-paradox-project
Question
s a is the doxastic appearance of s to a (or the theory of a about s). Define it formally.
Answer
\(s_a:S\rightarrow 2^S\), where \(s_a=\{t: s\rightarrow_a t\}\)

Tags
#conditional-doxastic-models #doxastic-logic #logic-of-conditional-beliefs #private-announcements #public-announcements #serious-possibility-paradox-project
Question
s a is the doxastic appearance of s to a (or the theory of a about s). Define it formally.
Answer
?

Tags
#conditional-doxastic-models #doxastic-logic #logic-of-conditional-beliefs #private-announcements #public-announcements #serious-possibility-paradox-project
Question
s a is the doxastic appearance of s to a (or the theory of a about s). Define it formally.
Answer
\(s_a:S\rightarrow 2^S\), where \(s_a=\{t: s\rightarrow_a t\}\)
If you want to change selection, open original toplevel document below and click on "Move attachment"

Parent (intermediate) annotation

Open it
The maps • a and •(a) are called appearance maps: s a is the doxastic appearance of s to a (or the theory of a about s), and s(a) is the epistemic appearance of s to a (or the knowledge of a about s). The equivalence between the two definitions of knowledge-belief models is easily verified<

Original toplevel document (pdf)

owner: rappatoni - (no access) - Baltag and Smets - conditional doxastic models a qualiltative approach to odynamic belief revision.pdf, p5

Summary

statusnot learnedmeasured difficulty37% [default]last interval [days]               
repetition number in this series0memorised on               scheduled repetition               
scheduled repetition interval               last repetition or drill

Details

No repetitions


Discussion

Do you want to join discussion? Click here to log in or create user.