Další formáty:
BibTeX
LaTeX
RIS
@article{1421886,
author = {Lieberman, Michael and Rosický, Jiří},
article_number = {2},
doi = {http://dx.doi.org/10.23638/LMCS-13(2:11)2017},
keywords = {accessible category; powerful image; Hanf number; strongly compact cardinal},
language = {eng},
issn = {1860-5974},
journal = {Logical Methods in Computer Science},
title = {Hanf numbers via accessible images},
url = {https://doi.org/10.23638/LMCS-13(2:11)2017},
volume = {13},
year = {2017}
}
TY - JOUR
ID - 1421886
AU - Lieberman, Michael - Rosický, Jiří
PY - 2017
TI - Hanf numbers via accessible images
JF - Logical Methods in Computer Science
VL - 13
IS - 2
SP - 1-15
EP - 1-15
SN - 18605974
KW - accessible category
KW - powerful image
KW - Hanf number
KW - strongly compact cardinal
UR - https://doi.org/10.23638/LMCS-13(2:11)2017
N2 - We present several new model-theoretic applications of the fact that, under the assumption that there exists a proper class of almost strongly compact cardinals, the powerful image of any accessible functor is accessible. In particular, we generalize to the context of accessible categories the recent Hanf number computations of Baldwin and Boney, namely that in an abstract elementary class (AEC) if the joint embedding and amalgamation properties hold for models of size up to a sufficiently large cardinal, then they hold for models of arbitrary size. Moreover, we prove that, under the above-mentioned large cardinal assumption, every metric AEC is strongly d-tame, strengthening a result of Boney and Zambrano and pointing the way to further generalizations.
ER -
LIEBERMAN, Michael a Jiří ROSICKÝ. Hanf numbers via accessible images. \textit{Logical Methods in Computer Science}. 2017, roč.~13, č.~2, s.~1-15. ISSN~1860-5974. Dostupné z: https://dx.doi.org/10.23638/LMCS-13(2:11)2017.
|
