Hanf Numbers and Presentation Theorems in AECs
Logic
2016-08-23 v2
Abstract
We prove that a strongly compact cardinal is an upper bound for a Hanf number for amalgamation, etc. in AECs using both semantic and syntactic methods. To syntactically prove non-disjoint amalgamation, a different presentation theorem than Shelah's is needed. This relational presentation theorem has the added advantage of being {\it functorial}, which allows the transfer of amalgamation.
Keywords
Cite
@article{arxiv.1511.02935,
title = {Hanf Numbers and Presentation Theorems in AECs},
author = {Will Boney and John Baldwin},
journal= {arXiv preprint arXiv:1511.02935},
year = {2016}
}