Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-16T19:00:50.137Z Has data issue: false hasContentIssue false

Π11 Borel sets

Published online by Cambridge University Press:  12 March 2014

Alexander S. Kechris
Affiliation:
Department of Mathematics, California Institute of Technology, Pasadena, California 91125Department of Mathematics, Statistics, and Computer Science, University of Illinois at Chicago, Chicago, Illinois 60680
David Marker
Affiliation:
Department of Mathematics, Cairo University, Cairo, Egypt
Ramez L. Sami
Affiliation:
UER de Mathématique, Université Paris-VII, 75251 Paris, France

Extract

The results in this paper were motivated by the following question of Sacks. Suppose T is a recursive theory with countably many countable models. What can you say about the least ordinal α such that all models of T have Scott rank below α? If Martin's conjecture is true for T then α ≤ ω · 2.

Our goal was to look at this problem in a more abstract setting. Let E be a equivalence relation on ωω with countably many classes each of which is Borel. What can you say about the least α such that each equivalence class is ? This problem is closely related to the following question. Suppose X ⊆ ωω is and Borel. What can you say about the least α such that X is ?

In §1 we answer these questions in ZFC. In §2 we give more informative answers under the added assumptions V = L or -determinacy. The final section contains related results on the separation of sets by Borel sets.

Our notation is standard. The reader may consult Moschovakis [5] for undefined terms.

Some of these results were proved first by Sami and rediscovered by Kechris and Marker.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1989

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