By Will Boney and John Baldwin

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... Show more

August 19, 2016

Loading full text...

Similar articles

Loading recommendations...

x1

Hanf Numbers and Presentation Theorems in AECs

Click on play to start listening