## Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

## If You Use a Screen Reader

This content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.

# Partitioning Subsets of Stable Models

Timothy Bays
The Journal of Symbolic Logic
Vol. 66, No. 4 (Dec., 2001), pp. 1899-1908
DOI: 10.2307/2694983
Stable URL: http://www.jstor.org/stable/2694983
Page Count: 10
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available

## 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|$^{< \kappa(T)}$ pieces, $\langle$ Ai ∣ i < |B|$^{< \kappa(T)}\rangle$, such that for each Ai there is a B$_i \subseteq$ B where |Bi| < κ(T) and Ai &2ADD; $\underset{B_i}$ B. Second, if A and B are as above and |A| > |B|, then we try to find A' $\subset$ A and B' $\subset$ B such that |A'| is as large as possible, |B'| is as small as possible, and A' &2ADD; $\underset{B'}$ B. We prove some positive results in this direction, and we discuss the optimality of these results under ZFC + GCH.

• 1899
• 1900
• 1901
• 1902
• 1903
• 1904
• 1905
• 1906
• 1907
• 1908