Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-16T23:31:55.918Z Has data issue: false hasContentIssue false

Partitioning subsets of stable models

Published online by Cambridge University Press:  12 March 2014

Timothy Bays*
Affiliation:
University of Notre Dame, Department of Philosophy, Notre Dame, IN 46556, USA, E-Mail: timothy.bays.5@nd.edu

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 , Second, if A and B are as above and ∣A∣ > ∣B∣, then we try to find A′ ⊂ A and B′ ⊂ B such that ∣A′∣ is as large as possible. ∣B′∣ is as small as possible, and . We prove some positive results in this direction, and we discuss the optimality of these results under ZFC + GCH.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2001

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable