Switch to: References

Add citations

You must login to add citations.
  1. Propositional Epistemic Logics with Quantification Over Agents of Knowledge (An Alternative Approach).Gennady Shtakser - 2019 - Studia Logica 107 (4):753-780.
    In the previous paper with a similar title :311–344, 2018), we presented a family of propositional epistemic logics whose languages are extended by two ingredients: by quantification over modal operators or over agents of knowledge and by predicate symbols that take modal operators as arguments. We denoted this family by \}\). The family \}\) is defined on the basis of a decidable higher-order generalization of the loosely guarded fragment of first-order logic. And since HO-LGF is decidable, we obtain the decidability (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Doxastic Logic: A New Approach.Daniel Rönnedal - 2018 - Journal of Applied Non-Classical Logics 28 (4):313-347.
    In this paper, I develop a new set of doxastic logical systems and I show how they can be used to solve several well-known problems in doxastic logic, for example the so-called problem of logical omniscience. According to this puzzle, the notions of knowledge and belief that are used in ordinary epistemic and doxastic symbolic systems are too idealised. Hence, those systems cannot be used to model ordinary human or human-like agents' beliefs. At best, they can describe idealised individuals. The (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • A Cut‐Free Calculus For Dummett's LC Quantified.Giovanna Corsi - 1989 - Mathematical Logic Quarterly 35 (4):289-301.
  • Propositional Epistemic Logics with Quantification Over Agents of Knowledge.Gennady Shtakser - 2018 - Studia Logica 106 (2):311-344.
    The paper presents a family of propositional epistemic logics such that languages of these logics are extended by quantification over modal operators or over agents of knowledge and extended by predicate symbols that take modal operators as arguments. Denote this family by \}\). There exist epistemic logics whose languages have the above mentioned properties :311–350, 1995; Lomuscio and Colombetti in Proceedings of ATAL 1996. Lecture Notes in Computer Science, vol 1193, pp 71–85, 1996). But these logics are obtained from first-order (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation