A combinatorial problem; stability and order for models and theories in infinitary languages
From MaRDI portal
Publication:2553434
DOI10.2140/pjm.1972.41.247zbMath0239.02024WikidataQ100600660 ScholiaQ100600660MaRDI QIDQ2553434
Publication date: 1972
Published in: Pacific Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2140/pjm.1972.41.247
03E15: Descriptive set theory
03C99: Model theory
03E05: Other combinatorial set theory
03C75: Other infinitary logic
Related Items
A proportional Dvoretzky-Rogers factorization result, The Glivenko-Cantelli problem, ten years later, Constructing strongly equivalent nonisomorphic models for unstable theories, Type, infratype and the Elton-Pajor theorem, Trade-offs between communication and space, A graph-theoretic generalization of the Sauer-Shelah lemma, Selecting a proportion of characters, Combinatorics and connectionism, Density results for uniform families, Vapnik-Chervonenkis dimension and (pseudo-)hyperplane arrangements, Some best possible bounds concerning the traces of finite sets, On the density of sets of divisors, On the convexified Sauer-Shelah theorem, Small forbidden configurations, An unclassifiable unidimensional theory without OTOP, Sperner families of bounded VC-dimension, Guarding galleries where every point sees a large area, Counterexample to the Frankl-Pach conjecture for uniform, dense families, PAC-learning from general examples, Traces of antichains, Forbidden configurations, discrepancy and determinants, Forbidden configurations: Induction and linear algebra, On membership comparable sets
