Infinitary Logics and Abstract Elementary Classes

DOI10.1090/PROC/15688MaRDI QIDQ6350574arXivFDO

Authors S. Shelah, Andrés Villaveces

Publication date 5 October 2020

Mathematics Subject Classification ID

Abstract model theory (03C95) Partition relations (03E02) Abstract elementary classes and related topics (03C48) Other infinitary logic (03C75) Interpolation, preservation, definability (03C40)

Abstract: We prove that every abstract elementary class (a.e.c.) with LST number $kappa$ and vocabulary $au$ of cardinality $leqkappa$ can be axiomatized in the logic $$. In this logic an a.e.c. is therefore an EC class rather than merely a PC class. This constitutes a major improvement on the level of definability previously given by the Presentation Theorem. As part of our proof, we define the emph{canonical tree} $mathcalS={mathcalS}_{mathcalK}$ of an a.e.c. $mathcalK$. This turns out to be an interesting combinatorial object of the class, beyond the aim of our theorem. Furthermore, we study a connection between the sentences defining an a.e.c. and the relatively new infinitary logic $L_l^{1}ambda$.}

This page was built for publication: Infinitary Logics and Abstract Elementary Classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6350574)