9 found
Order:
See also
  1.  10
    One Modal Logic to Rule Them All?Wesley H. Holliday & Tadeusz Litak - 2018 - In Guram Bezhanishvili, Giovanna D'Agostino, George Metcalfe & Thomas Studer (eds.), Advances in Modal Logic, Vol. 12. London: College Publications. pp. 367-386.
    In this paper, we introduce an extension of the modal language with what we call the global quantificational modality [∀p]. In essence, this modality combines the propositional quantifier ∀p with the global modality A: [∀p] plays the same role as the compound modality ∀pA. Unlike the propositional quantifier by itself, the global quantificational modality can be straightforwardly interpreted in any Boolean Algebra Expansion (BAE). We present a logic GQM for this language and prove that it is complete with respect to (...)
    Direct download  
     
    Export citation  
     
    Bookmark   4 citations  
  2.  32
    Complete Additivity and Modal Incompleteness.Wesley H. Holliday & Tadeusz Litak - 2019 - Review of Symbolic Logic 12 (3):487-535.
    In this article, we tell a story about incompleteness in modal logic. The story weaves together an article of van Benthem, “Syntactic aspects of modal incompleteness theorems,” and a longstanding open question: whether every normal modal logic can be characterized by a class of completely additive modal algebras, or as we call them, ${\cal V}$-baos. Using a first-order reformulation of the property of complete additivity, we prove that the modal logic that starred in van Benthem’s article resolves the open question (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  3.  14
    Infinite Populations, Choice and Determinacy.Tadeusz Litak - 2018 - Studia Logica 106 (5):969-999.
    This paper criticizes non-constructive uses of set theory in formal economics. The main focus is on results on preference aggregation and Arrow’s theorem for infinite electorates, but the present analysis would apply as well, e.g., to analogous results in intergenerational social choice. To separate justified and unjustified uses of infinite populations in social choice, I suggest a principle which may be called the Hildenbrand criterion and argue that results based on unrestricted axiom of choice do not meet this criterion. The (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  4.  22
    All Finitely Axiomatizable Tense Logics of Linear Time Flows Are CoNP-Complete.Tadeusz Litak & Frank Wolter - 2005 - Studia Logica 81 (2):153-165.
    We prove that all finitely axiomatizable tense logics with temporal operators for ‘always in the future’ and ‘always in the past’ and determined by linear fows time are coNP-complete. It follows, for example, that all tense logics containing a density axiom of the form ■n+1F p → nF p, for some n ≥ 0, are coNP-complete. Additionally, we prove coNP-completeness of all ∩-irreducible tense logics. As these classes of tense logics contain many Kripke incomplete bimodal logics, we obtain many natural (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  5.  26
    Some Modal Aspects of XPath.Balder ten Cate, Gaëlle Fontaine & Tadeusz Litak - 2010 - Journal of Applied Non-Classical Logics 20 (3):139-171.
    This paper provides several examples of how modal logic can be used in studying the XML document navigation language XPath. More specifically, we derive complete axiomatizations, computational complexity and expressive power results for XPath fragments from known results for corresponding logics. A secondary aim of the paper is to introduce XPath in a way that makes it accessible to an audience of modal logicians.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  6.  17
    Modal Incompleteness Revisited.Tadeusz Litak - 2004 - Studia Logica 76 (3):329 - 342.
    In this paper, we are going to analyze the phenomenon of modal incompleteness from an algebraic point of view. The usual method of showing that a given logic L is incomplete is to show that for some L and some cannot be separated from by a suitably wide class of complete algebras — usually Kripke algebras. We are going to show that classical examples of incomplete logics, e.g., Fine logic, are not complete with respect to any class of complete BAOs. (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  7.  24
    Complete Axiomatizations for XPath Fragments.Balder ten Cate, Tadeusz Litak & Maarten Marx - 2010 - Journal of Applied Logic 8 (2):153-172.
  8.  2
    Isomorphism Via Translation.Tadeusz Litak - 2006 - In Guido Governatori, Ian Hodkinson & Yde Venema (eds.), Advances in Modal Logic, Volume 6. CSLI Publications. pp. 333-351.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  9.  16
    Some Notes on the Superintuitionistic Logic of Chequered Subsets of R∞.Tadeusz Litak - 2004 - Bulletin of the Section of Logic 33 (2):81-86.
    Direct download  
     
    Export citation  
     
    Bookmark