Partitioning subsets of stable models
Journal of Symbolic Logic 66 (4):1899-1908 (2001)
| Abstract | This paper discusses two combinatorial problems in stability theory. First we prove a partition result for subsets of stable models: for any A and B, we can partition A into |B |<κ(T ) pieces, Ai | i < |B |<κ(T ) , such that for each Ai there is a Bi ⊆ B where |Bi| < κ(T ) and Ai.. | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,875 |
| External links |
  Try with proxy. |
| Through your library | Configure |
Similar books and articlesB. Hart, A. Pillay & S. Starchenko (1995). 1-Based Theories — the Main Gap for a -Models. Archive for Mathematical Logic 34 (5).
R. J. Watro (1984). On Partitioning the Infinite Subsets of Large Cardinals. Journal of Symbolic Logic 49 (2):539-541.
Ludomir Newelski (1996). On Atomic or Saturated Sets. Journal of Symbolic Logic 61 (1):318-333.
Steven Buechler (1984). Expansions of Models of Ω-Stable Theories. Journal of Symbolic Logic 49 (2):470-477.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-01-28Total downloads0Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
