Lascar strong types in some simple theories

Journal of Symbolic Logic 64 (2):817-824 (1999)
  Copy   BIBTEX

Abstract

In this paper a class of simple theories, called the low theories is developed, and the following is proved. Theorem. Let T be a low theory. A set and a, b elements realizing the same strong type over A. Then, a and b realized the same Lascar strong type over A

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,322

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2009-01-28

Downloads
20 (#744,405)

6 months
1 (#1,533,009)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Lovely pairs of models.Itay Ben-Yaacov, Anand Pillay & Evgueni Vassiliev - 2003 - Annals of Pure and Applied Logic 122 (1-3):235-261.
On the existence of indiscernible trees.Kota Takeuchi & Akito Tsuboi - 2012 - Annals of Pure and Applied Logic 163 (12):1891-1902.
The number of types in simple theories.Enrique Casanovas - 1999 - Annals of Pure and Applied Logic 98 (1-3):69-86.
A Supersimple Nonlow Theory.Enrique Casanovas & Byunghan Kim - 1998 - Notre Dame Journal of Formal Logic 39 (4):507-518.

View all 11 citations / Add more citations

References found in this work

Classification Theory and the Number of Nonisomorphic Models.S. Shelah - 1982 - Journal of Symbolic Logic 47 (3):694-696.
Simple unstable theories.Saharon Shelah - 1980 - Annals of Mathematical Logic 19 (3):177.

Add more references