Works by Mekler, Alan (exact spelling)

5 found
Order:
  1.  63
    Trees and Π 1 1 -Subsets of ω1 ω 1.Alan Mekler & Jouko Vaananen - 1993 - Journal of Symbolic Logic 58 (3):1052 - 1070.
    We study descriptive set theory in the space ω1 ω 1 by letting trees with no uncountable branches play a similar role as countable ordinals in traditional descriptive set theory. By using such trees, we get, for example, a covering property for the class of Π 1 1 -sets of ω1 ω 1 . We call a family U of trees universal for a class V of trees if $\mathscr{U} \subseteq \mathscr{V}$ and every tree in V can be order-preservingly mapped (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  2.  19
    Trees and -subsets of ω1ω1.Alan Mekler & Jouko Väänänen - 1993 - Journal of Symbolic Logic 58 (3):1052-1070.
  3.  22
    Trees and $Pi^11$-Subsets of $^{omega_1}omega1$.Alan Mekler & Jouko Vaananen - 1993 - Journal of Symbolic Logic 58 (3):1052-1070.
    We study descriptive set theory in the space $^{\omega_1}\omega_1$ by letting trees with no uncountable branches play a similar role as countable ordinals in traditional descriptive set theory. By using such trees, we get, for example, a covering property for the class of $\Pi^1_1$-sets of $^{\omega_1}\omega_1$. We call a family $\mathscr{U}$ of trees universal for a class $\mathscr{V}$ of trees if $\mathscr{U} \subseteq \mathscr{V}$ and every tree in $\mathscr{V}$ can be order-preservingly mapped into a tree in $\mathscr{U}$. It is well (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  4.  17
    Uncountable Homogeneous Partial Orders.Manfred Droste, Dugald Macpherson & Alan Mekler - 2002 - Mathematical Logic Quarterly 48 (4):525-532.
    A partially ordered set is called k-homogeneous if any isomorphism between k-element subsets extends to an automorphism of . Assuming the set-theoretic assumption ⋄, it is shown that for each k, there exist partially ordered sets of size ϰ1 which embed each countable partial order and are k-homogeneous, but not -homogeneous. This is impossible in the countable case for k ≥ 4.
    Direct download  
     
    Export citation  
     
    Bookmark  
  5.  30
    Theories with models of prescribed cardinalities.Alan Mekler - 1977 - Journal of Symbolic Logic 42 (2):251-253.