Stable structures homogeneous for a finite binary language |
| |
| Authors: | Alistair H Lachlan Saharon Shelah |
| |
| Institution: | (1) Institute for Advanced Studies, The Hebrew University of Jerusalem, Jerusalem, Israel;(2) Present address: Department of Mathematics, Simon Fraser University, V5A 1S6 Burnaby, B.C., Canada;(3) Present address: Institute of Mathematics, The Hebrew University of Mathematics, Jerusalem, Israel |
| |
| Abstract: | LetL be a finite relational language andH(L) denote the class of all countable stableL-structuresM for which Th(M) admits elimination of quantifiers. ForM ∈H(L) define the rank ofM to be the maximum value of CR(p, 2), wherep is a complete 1-type over Ø and CR(p, 2) is Shelah’s complete rank. IfL has only unary and binary relation symbols there is a uniform finite bound for the rank ofM ∈H(L). This theorem confirms part of a conjecture of the first author. Intuitively it says that for eachL there is a finite bound on the complexity of the structures inH(L). |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
