Axiomatizing AECs and applications
From MaRDI portal
Publication:6375768
Abstract: For any abstract elementary class (AEC) with , the following holds: 1. has an axiomatization in , allowing game quantification. If has arbitrarily large models, the -amalgamation property and is categorical both in and , then it has an axiomatization in with game quantification. These extend Kueker's result which assumes finite character and . 2. If is universal and categorical in , then it is axiomatizable in . 3. Shelah's celebrated presentation theorem asserts that for any AEC there is a first-order theory in an expansion of , and a set of many -types such that . We provide a better bound on in terms of . 4. We present additional applications which extend, simplify and generalize results of Shelah and Shelah-Vasey. Some of our main results generalize to -AECs.
This page was built for publication: Axiomatizing AECs and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6375768)