Switch to: References

Add citations

You must login to add citations.
  1. Ideals on $${P_{\kappa}}$$ P κ associated with games of uncountable length.Pierre Matet - 2015 - Archive for Mathematical Logic 54 (3-4):291-328.
    We study normal ideals on Pκ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${P_{\kappa} }$$\end{document} that are defined in terms of games of uncountable length.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  • Remarks on The Cartesian Closure.Lauri Hella & Michal Krynicki - 1991 - Mathematical Logic Quarterly 37 (33‐35):539-545.
  • Remarks on The Cartesian Closure.Lauri Hella & Michal Krynicki - 1991 - Mathematical Logic Quarterly 37 (33-35):539-545.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • A double arity hierarchy theorem for transitive closure logic.Martin Grohe & Lauri Hella - 1996 - Archive for Mathematical Logic 35 (3):157-171.
    In this paper we prove that thek-ary fragment of transitive closure logic is not contained in the extension of the (k−1)-ary fragment of partial fixed point logic by all (2k−1)-ary generalized quantifiers. As a consequence, the arity hierarchies of all the familiar forms of fixed point logic are strict simultaneously with respect to the arity of the induction predicates and the arity of generalized quantifiers.Although it is known that our theorem cannot be extended to the sublogic deterministic transitive closure logic, (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  • κ-Stationary Subsets of Pκ+Λ, Infinitary Games, and Distributive Laws in Boolean Algebras.Natasha Dobrinen - 2008 - Journal of Symbolic Logic 73 (1):238 - 260.
    We characterize the (κ, Λ, < μ)-distributive law in Boolean algebras in terms of cut and choose games $\scr{G}_{<\mu}^{\kappa}(\lambda)$ , when μ ≤ κ ≤ Λ and κ<κ = κ. This builds on previous work to yield game-theoretic characterizations of distributive laws for almost all triples of cardinals κ, Λ, μ with μ ≤ Λ, under GCH. In the case when μ ≤ κ ≤ Λ and κ<κ = κ, we show that it is necessary to consider whether the κ-stationarity (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  • Definability properties and the congruence closure.Xavier Caicedo - 1990 - Archive for Mathematical Logic 30 (4):231-240.
    We introduce a natural class of quantifiersTh containing all monadic type quantifiers, all quantifiers for linear orders, quantifiers for isomorphism, Ramsey type quantifiers, and plenty more, showing that no sublogic ofL ωω (Th) or countably compact regular sublogic ofL ∞ω (Th), properly extendingL ωω , satisfies the uniform reduction property for quotients. As a consequence, none of these logics satisfies eitherΔ-interpolation or Beth's definability theorem when closed under relativizations. We also show the failure of both properties for any sublogic ofL (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation