Title of article
Karp complexity and classes with the independence property Original Research Article
Author/Authors
M.C. Laskowski، نويسنده , , S. Shelah، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2003
Pages
21
From page
263
To page
283
Abstract
A class View the MathML source of structures is controlled if for all cardinals λ, the relation of L∞,λ-equivalence partitions View the MathML source into a set of equivalence classes (as opposed to a proper class). We prove that no pseudo-elementary class with the independence property is controlled. By contrast, there is a pseudo-elementary class with the strict order property that is controlled (see Arch. Math. Logic 40 (2001) 69–88).
Keywords
Coding graphs , Independence property , Non-structure theorems
Journal title
Annals of Pure and Applied Logic
Serial Year
2003
Journal title
Annals of Pure and Applied Logic
Record number
889894
Link To Document