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  
  • Sacks forcing, Laver forcing, and Martin's axiom.Haim Judah, Arnold W. Miller & Saharon Shelah - 1992 - Archive for Mathematical Logic 31 (3):145-161.
    In this paper we study the question assuming MA+⌝CH does Sacks forcing or Laver forcing collapse cardinals? We show that this question is equivalent to the question of what is the additivity of Marczewski's ideals 0. We give a proof that it is consistent that Sacks forcing collapses cardinals. On the other hand we show that Laver forcing does not collapse cardinals.
    Download  
     
    Export citation  
     
    Bookmark   19 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  
  • Definability and undefinability with real order at the background.Yuri Gurevich & Alexander Rabinovich - 2000 - Journal of Symbolic Logic 65 (2):946-958.
    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  
  • An algebraic approach to mso-definability on countable linear orderings.Olivier Carton, Thomas Colcombet & Gabriele Puppis - 2018 - Journal of Symbolic Logic 83 (3):1147-1189.
    Download  
     
    Export citation  
     
    Bookmark  
  • (1 other version)Modal logic of time division.Tero Tulenheimo - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 363-387.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Continuous Ramsey theory on polish spaces and covering the plane by functions.Stefan Geschke, Martin Goldstern & Menachem Kojman - 2004 - Journal of Mathematical Logic 4 (2):109-145.
    We investigate the Ramsey theory of continuous graph-structures on complete, separable metric spaces and apply the results to the problem of covering a plane by functions. Let the homogeneity number[Formula: see text] of a pair-coloring c:[X]2→2 be the number of c-homogeneous subsets of X needed to cover X. We isolate two continuous pair-colorings on the Cantor space 2ω, c min and c max, which satisfy [Formula: see text] and prove: Theorem. For every Polish space X and every continuous pair-coloringc:[X]2→2with[Formula: see (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • 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  
  • Peano arithmetic may not be interpretable in the monadic theory of linear orders.Shmuel Lifsches & Saharon Shelah - 1997 - Journal of Symbolic Logic 62 (3):848-872.
    Gurevich and Shelah have shown that Peano Arithmetic cannot be interpreted in the monadic second-order theory of short chains (hence, in the monadic second-order theory of the real line). We will show here that it is consistent that the monadic second-order theory of no chain interprets Peano Arithmetic.
    Download  
     
    Export citation  
     
    Bookmark