Karp complexity and classes with the independence property

M. C. Laskowski*, S. Shelah

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

7 Scopus citations

Abstract

A class K of structures is controlled if for all cardinals λ, the relation of L,λ-equivalence partitions K 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).

Original languageEnglish
Pages (from-to)263-283
Number of pages21
JournalAnnals of Pure and Applied Logic
Volume120
Issue number1-3
DOIs
StatePublished - 15 Apr 2003

Keywords

  • Coding graphs
  • Independence property
  • Non-structure theorems

Fingerprint

Dive into the research topics of 'Karp complexity and classes with the independence property'. Together they form a unique fingerprint.

Cite this