Currently displaying 1 – 1 of 1

Showing per page

Order by Relevance | Title | Year of publication

Counting partial types in simple theories

Olivier Lessmann — 2000

Colloquium Mathematicae

We continue the work of Shelah and Casanovas on the cardinality of families of pairwise inconsistent types in simple theories. We prove that, in a simple theory, there are at most λ < κ ( T ) + 2 μ + | T | pairwise inconsistent types of size μ over a set of size λ. This bound improves the previous bounds and clarifies the role of κ(T). We also compute exactly the maximal cardinality of such families for countable, simple theories. The main tool is the fact that, in simple theories, the collection of nonforking extensions...

Page 1

Download Results (CSV)