Switch to: Citations

Add references

You must login to add references.
  1. Syntactic cut-elimination for a fragment of the modal mu-calculus.Kai Brünnler & Thomas Studer - 2012 - Annals of Pure and Applied Logic 163 (12):1838-1853.
    For some modal fixed point logics, there are deductive systems that enjoy syntactic cut-elimination. An early example is the system in Pliuskevicius [15] for LTL. More recent examples are the systems by the authors of this paper for the logic of common knowledge [5] and by Hill and Poggiolesi for PDL[8], which are based on a form of deep inference. These logics can be seen as fragments of the modal mu-calculus. Here we are interested in how far this approach can (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • About cut elimination for logics of common knowledge.Luca Alberucci & Gerhard Jäger - 2005 - Annals of Pure and Applied Logic 133 (1):73-99.
    The notions of common knowledge or common belief play an important role in several areas of computer science , in philosophy, game theory, artificial intelligence, psychology and many other fields which deal with the interaction within a group of “agents”, agreement or coordinated actions. In the following we will present several deductive systems for common knowledge above epistemic logics –such as K, T, S4 and S5 –with a fixed number of agents. We focus on structural and proof-theoretic properties of these (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  • Deduction chains for common knowledge.Mathis Kretz & Thomas Studer - 2006 - Journal of Applied Logic 4 (3):331-357.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • Cut-free common knowledge.Gerhard Jäger, Mathis Kretz & Thomas Studer - 2007 - Journal of Applied Logic 5 (4):681-689.
  • On intuitionistic modal epistemic logic.Timothy Williamson - 1992 - Journal of Philosophical Logic 21 (1):63--89.