Switch to: References

Add citations

You must login to add citations.
  1. Axiomatizability of Propositionally Quantified Modal Logics on Relational Frames.Peter Fritz - 2024 - Journal of Symbolic Logic 89 (2):758-793.
    Propositional modal logic over relational frames is naturally extended with propositional quantifiers by letting them range over arbitrary sets of worlds of the relevant frame. This is also known as second-order propositional modal logic. The propositionally quantified modal logic of a class of relational frames is often not axiomatizable, although there are known exceptions, most notably the case of frames validating the strong modal logic $\mathrm {S5}$. Here, we develop new general methods with which many of the open questions in (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • The structure of the models of decidable monadic theories of graphs.D. Seese - 1991 - Annals of Pure and Applied Logic 53 (2):169-195.
    In this article the structure of the models of decidable monadic theories of planar graphs is investigated. It is shown that if the monadic theory of a class K of planar graphs is decidable, then the tree-width in the sense of Robertson and Seymour of the elements of K is universally bounded and there is a class T of trees such that the monadic theory of K is interpretable in the monadic theory of T.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Monadic logic and löwenheim numbers.Saharon Shelah - 1985 - Annals of Pure and Applied Logic 28 (2):203-216.
    We investigate the monadic logic of trees with ω + 1 levels, the monadic topology of the product space ω λ and a strengthening of monadic logic for trees with ω levels.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Propositional Quantification in the Topological Semantics for S.Philip Kremer - 1997 - Notre Dame Journal of Formal Logic 38 (2):295-313.
    Fine and Kripke extended S5, S4, S4.2 and such to produce propositionally quantified systems , , : given a Kripke frame, the quantifiers range over all the sets of possible worlds. is decidable and, as Fine and Kripke showed, many of the other systems are recursively isomorphic to second-order logic. In the present paper I consider the propositionally quantified system that arises from the topological semantics for S4, rather than from the Kripke semantics. The topological system, which I dub , (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • On countable chains having decidable monadic theory.Alexis Bés & Alexander Rabinovich - 2012 - Journal of Symbolic Logic 77 (2):593-608.
    Rationals and countable ordinals are important examples of structures with decidable monadic second-order theories. A chain is an expansion of a linear order by monadic predicates. We show that if the monadic second-order theory of a countable chain C is decidable then C has a non-trivial expansion with decidable monadic second-order theory.
    Download  
     
    Export citation  
     
    Bookmark  
  • The Expressive Power of Second-Order Propositional Modal Logic.Michael Kaminski & Michael Tiomkin - 1996 - Notre Dame Journal of Formal Logic 37 (1):35-43.
    It is shown that the expressive power of second-order propositional modal logic whose modalities are S4.2 or weaker is the same as that of second-order predicate logic.
    Download  
     
    Export citation  
     
    Bookmark   17 citations