549 research outputs found

    Combinatorial Properties and Dependent choice in symmetric extensions based on L\'{e}vy Collapse

    Get PDF
    We work with symmetric extensions based on L\'{e}vy Collapse and extend a few results of Arthur Apter. We prove a conjecture of Ioanna Dimitriou from her P.h.d. thesis. We also observe that if VV is a model of ZFC, then DC<κDC_{<\kappa} can be preserved in the symmetric extension of VV in terms of symmetric system ⟨P,G,F⟩\langle \mathbb{P},\mathcal{G},\mathcal{F}\rangle, if P\mathbb{P} is κ\kappa-distributive and F\mathcal{F} is κ\kappa-complete. Further we observe that if VV is a model of ZF + DCκDC_{\kappa}, then DC<κDC_{<\kappa} can be preserved in the symmetric extension of VV in terms of symmetric system ⟨P,G,F⟩\langle \mathbb{P},\mathcal{G},\mathcal{F}\rangle, if P\mathbb{P} is κ\kappa-strategically closed and F\mathcal{F} is κ\kappa-complete.Comment: Revised versio

    On Galvin's lemma and Ramsey spaces

    Full text link
    An abstract version of Galvin's lemma is proven, within the framework of the theory of Ramsey spaces. Some instances of it are explored.Comment: Accepted in Annals of Combinatoric

    On union ultrafilters

    Full text link
    We present some new results on union ultrafilters. We characterize stability for union ultrafilters and, as the main result, we construct a new kind of unordered union ultrafilter

    Tameness in least fixed-point logic and McColm's conjecture

    Full text link
    We investigate four model-theoretic tameness properties in the context of least fixed-point logic over a family of finite structures. We find that each of these properties depends only on the elementary (i.e., first-order) limit theory, and we completely determine the valid entailments among them. In contrast to the context of first-order logic on arbitrary structures, the order property and independence property are equivalent in this setting. McColm conjectured that least fixed-point definability collapses to first-order definability exactly when proficiency fails. McColm's conjecture is known to be false in general. However, we show that McColm's conjecture is true for any family of finite structures whose limit theory is model-theoretically tame
    • …
    corecore