机构:
Univ Illinois, Dept Math Stat & Comp Sci, Chicago, IL 60607 USAUniv Illinois, Dept Math Stat & Comp Sci, Chicago, IL 60607 USA
Baldwin, John T.
[1
]
Shelah, Saharon
论文数: 0引用数: 0
h-index: 0
机构:
Hebrew Univ Jerusalem, Inst Math, IL-91904 Jerusalem, Israel
Rutgers State Univ, Dept Math, New Brunswick, NJ 08854 USAUniv Illinois, Dept Math Stat & Comp Sci, Chicago, IL 60607 USA
Shelah, Saharon
[2
,3
]
机构:
[1] Univ Illinois, Dept Math Stat & Comp Sci, Chicago, IL 60607 USA
[2] Hebrew Univ Jerusalem, Inst Math, IL-91904 Jerusalem, Israel
[3] Rutgers State Univ, Dept Math, New Brunswick, NJ 08854 USA
We use kappa-free but not Whitehead Abelian groups to construct Abstract Elementary Classes (AEC) which satisfy the amalgamation property but fail various conditions on the locality of Galois-types. We introduce the notion that an AEC admits intersections. We conclude that for AEC which admit intersections. the amalgamation property can have no positive effect on locality: there is a transformation of AEC's which preserves non-locality but takes any AEC which admits intersections to one with amalgamation. More specifically we have: Theorem 5.3. There is an AEC with amalgamation which is not (N-0. N-1)-tame but is (2(N0), infinity)-tame: Theorem 3.3. It is consistent with ZFC that there is an AEC with amalgamation which is not (<= N-2, <= N-2)-compact.
机构:
Dahlem Center for Complex Quantum Systems, Freie Universität Berlin, Berlin, GermanyDahlem Center for Complex Quantum Systems, Freie Universität Berlin, Berlin, Germany
Campbell, Earl T.
Hoban, Matty J.
论文数: 0引用数: 0
h-index: 0
机构:
ICFO-Institut de Ciències Fotòniques, Mediterranean Technology Park, Castelldefels (Barcelona), SpainDahlem Center for Complex Quantum Systems, Freie Universität Berlin, Berlin, Germany
Hoban, Matty J.
Eisert, Jens
论文数: 0引用数: 0
h-index: 0
机构:
Dahlem Center for Complex Quantum Systems, Freie Universität Berlin, Berlin, GermanyDahlem Center for Complex Quantum Systems, Freie Universität Berlin, Berlin, Germany
Eisert, Jens
Quantum Information and Computation,
2014,
14
(11-12):
: 981
-
995