Hanf numbers and presentation theorems in AECs
From MaRDI portal
(Redirected from Publication:5221586)
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.
Recommendations
Cited in
(15)- Hanf number of the first stability cardinal in AECs
- Hanf numbers for extendibility and related phenomena
- Sizes and filtrations in accessible categories
- Kurepa trees and spectra of \(\mathcal{L}_{\omega_1, \omega}\)-sentences
- Axiomatizing AECs and applications
- The joint embedding property and maximal models
- A lower bound for the Hanf number for joint embedding
- Complete \(\mathcal{L}_{\omega_1,\omega}\)-sentences with maximal models in multiple cardinalities
- Hanf numbers via accessible images
- Structural logic and abstract elementary classes with intersections
- The Hanf number in the strictly stable case
- Maximal models up to the first measurable in ZFC
- Categoricity and multidimensional diagrams
- Cofinality quantifiers in abstract elementary classes and beyond
- Models of an abstract elementary class as a Generalized Polish Space
This page was built for publication: Hanf numbers and presentation theorems in AECs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5221586)
