Axiomatizing AECs and applications

From MaRDI portal
Publication:6375768




Abstract: For any abstract elementary class (AEC) with , the following holds: 1. K has an axiomatization in L(2lambda)+,lambda+, allowing game quantification. If has arbitrarily large models, the lambda-amalgamation property and is categorical both in lambda and lambda+, then it has an axiomatization in Llambda+,lambda+ with game quantification. These extend Kueker's result which assumes finite character and lambda=aleph0. 2. If K is universal and categorical in lambda, then it is axiomatizable in Llambda+,lambda+. 3. Shelah's celebrated presentation theorem asserts that for any AEC there is a first-order theory in an expansion of , and a set Gamma of 2lambda many T-types such that . We provide a better bound on |Gamma| 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 mu-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)