Expressivity and completeness for public update logics via reduction axioms

Abstract
In this paper, we present several extensions of epistemic logic with update operators modelling public information change. Next to the well-known public announcement operators, we also study public substitution operators. We prove many of the results regarding expressivity and completeness using so-called reduction axioms. We develop a general method for using reduction axioms and apply it to the logics at hand
Keywords No keywords specified (fix it)
Categories No categories specified
(categorize this paper)
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 9,351
External links
  •   Try with proxy.
  •   Try with proxy.
  • Through your library Configure
    References found in this work BETA
    Jelle Gerbrandy & Willem Groeneveld (1997). Reasoning About Information Change. Journal of Logic, Language and Information 6 (2):147-169.

    View all 7 references

    Citations of this work BETA
    Similar books and articles
    Analytics

    Monthly downloads

    Added to index

    2010-07-26

    Total downloads

    4 ( #198,532 of 1,088,398 )

    Recent downloads (6 months)

    1 ( #69,601 of 1,088,398 )

    How can I increase my downloads?

    My notes
    Sign in to use this feature


    Discussion
    Start a new thread
    Order:
    There  are no threads in this forum
    Nothing in this forum yet.