16 found
Order:
Disambiguations
Alan H. Mekler [11]Alan Mekler [5]
  1. Stability of nilpotent groups of class 2 and prime exponent.Alan H. Mekler - 1981 - Journal of Symbolic Logic 46 (4):781-788.
    Let p be an odd prime. A method is described which given a structure M of finite similarity type produces a nilpotent group of class 2 and exponent p which is in the same stability class as M. Theorem. There are nilpotent groups of class 2 and exponent p in all stability classes. Theorem. The problem of characterizing a stability class is equivalent to characterizing the (nilpotent, class 2, exponent p) groups in that class.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  2.  60
    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  
  3.  19
    Trees and -subsets of ω1ω1.Alan Mekler & Jouko Väänänen - 1993 - Journal of Symbolic Logic 58 (3):1052-1070.
  4.  13
    Stationary logic and its friends. I.Alan H. Mekler & Saharon Shelah - 1985 - Notre Dame Journal of Formal Logic 26 (2):129-138.
  5.  41
    Universal structures in power ℵ1.Alan H. Mekler - 1990 - Journal of Symbolic Logic 55 (2):466-477.
    It is consistent with ¬CH that every universal theory of relational structures with the joint embedding property and amalgamation for P --diagrams has a universal model of cardinality ℵ 1. For classes with amalgamation for P --diagrams it is consistent that $2^{\aleph_0} > \aleph_2$ and there is a universal model of cardinality ℵ 2.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  6.  11
    Stationary logic and its friends. II.Alan H. Mekler & Saharon Shelah - 1986 - Notre Dame Journal of Formal Logic 27 (1):39-50.
  7.  14
    Categoricity results for L∞κ.Paul C. Eklof & Alan H. Mekler - 1988 - Annals of Pure and Applied Logic 37 (1):81-99.
  8. C. C. C. forcing without combinatorics.Alan H. Mekler - 1984 - Journal of Symbolic Logic 49 (3):830-832.
    c.c.c. posets are characterised in terms of N-generic conditions. This characterisation can be applied to get simple proofs of many facts about c.c.c. forcing including $\operatorname{Con}(MA + \neg CH)$.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  9. Uniformization principles.Alan H. Mekler & Saharon Shelah - 1989 - Journal of Symbolic Logic 54 (2):441-459.
    It is consistent that for many cardinals λ there is a family of at least λ + unbounded subsets of λ which have uniformization properties. In particular if it is consistent that a supercompact cardinal exists, then it is consistent that ℵ ω has such a family. We have applications to point set topology, Whitehead groups and reconstructing separable abelian p-groups from their socles.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  10.  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  
  11.  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  
  12.  4
    Categoricity results for< i> L_< sub>∞ κ.Paul C. Eklof & Alan H. Mekler - 1988 - Annals of Pure and Applied Logic 37 (1):81-99.
  13.  33
    On the logic of continuous algebras.Jiří Adámek, Alan H. Mekler, Evelyn Nelson & Jan Reiterman - 1988 - Notre Dame Journal of Formal Logic 29 (3):365-380.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  14.  23
    Stationary logic of ordinals.Alan H. Mekler - 1984 - Annals of Pure and Applied Logic 26 (1):47-68.
  15.  30
    Theories with models of prescribed cardinalities.Alan Mekler - 1977 - Journal of Symbolic Logic 42 (2):251-253.
  16.  19
    Universal Structures in Power $aleph_1$.Alan H. Mekler - 1990 - Journal of Symbolic Logic 55 (2):466-477.
    It is consistent with $\neg\mathrm{CH}$ that every universal theory of relational structures with the joint embedding property and amalgamation for $\mathscr{P}^-(3)$-diagrams has a universal model of cardinality $\aleph_1$. For classes with amalgamation for $\mathscr{P}^-(4)$-diagrams it is consistent that $2^{\aleph_0} > \aleph_2$ and there is a universal model of cardinality $\aleph_2$.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark