z-logo
Premium
On the Number of Countable Models of a Countable Supersimple Theory
Author(s) -
Kim Byunghan
Publication year - 1999
Publication title -
journal of the london mathematical society
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.441
H-Index - 62
eISSN - 1469-7750
pISSN - 0024-6107
DOI - 10.1112/s0024610799008054
Subject(s) - countable set , mathematics , extension (predicate logic) , pure mathematics , discrete mathematics , computer science , programming language
It is proved that the number of countable models of a countable supersimple theory is either 1 or infinite. This result is an extension of Lachlan's theorem on a superstable theory.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom