Order:
  1.  98
    Everything is Knowable – How to Get to Know Whether a Proposition is True.Hans van Ditmarsch, Wiebe van der Hoek & Petar Iliev - 2012 - Theoria 78 (2):93-114.
    Fitch showed that not every true proposition can be known in due time; in other words, that not every proposition is knowable. Moore showed that certain propositions cannot be consistently believed. A more recent dynamic phrasing of Moore-sentences is that not all propositions are known after their announcement, i.e., not every proposition is successful. Fitch's and Moore's results are related, as they equally apply to standard notions of knowledge and belief (S 5 and KD45, respectively). If we interpret ‘successful’ as (...)
    Direct download  
     
    Export citation  
     
    Bookmark   8 citations  
  2. On the Succinctness of Some Modal Logics.Tim French, Wiebe van der Hoek, Petar Iliev & Barteld Kooi - 2013 - Artificial Intelligence 197:56-85.
  3.  16
    Succinctness of Epistemic Languages.Barteld Kooi, Wiebe van der Hoek, Petar Iliev & Tim French - unknown
    Tim French, Wiebe van der Hoek, Petar Iliev and Barteld Kooi. Succinctness of Epistemic Languages. In: T. Walsh (editor). Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI-11), pp. 881-886, AAAI Press, Menlo Park.
    Direct download  
     
    Export citation  
     
    Bookmark   7 citations  
  4.  2
    Frame-Validity Games and Lower Bounds on the Complexity of Modal Axioms.Philippe Balbiani, David Fernández-Duque, Andreas Herzig & Petar Iliev - 2022 - Logic Journal of the IGPL 30 (1):155-185.
    We introduce frame-equivalence games tailored for reasoning about the size, modal depth, number of occurrences of symbols and number of different propositional variables of modal formulae defining a given frame property. Using these games, we prove lower bounds on the above measures for a number of well-known modal axioms; what is more, for some of the axioms, we show that they are optimal among the formulae defining the respective class of frames.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  5.  4
    Some Exponential Lower Bounds on Formula-Size in Modal Logic.Hans van Ditmarsch, Wiebe van der Hoek & Petar Iliev - 2014 - In Rajeev Goré, Barteld Kooi & Agi Kurucz (eds.), Advances in Modal Logic, Volume 10. CSLI Publications. pp. 139-157.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  6. On Semantically Labelled Syntax Trees and the Non-Existence of Certain Sahlqvist Formulae.Petar Iliev - forthcoming - Logic Journal of the IGPL.
    We elaborate on semantically labelled syntax trees that provide a method of proving the non-existence of modal formulae satisfying certain syntactic properties and defining a given class of frames and use them to show that there are classes of Kripke frames that are definable by both non-Sahlqvist and Sahlqvist formulae, but the latter requires more propositional variables.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark