628 research outputs found
Oral History Interview on Sheff vs. O\u27Neill (with video)
Karen and Leo Harrington (both born in 1949) recall their activism for school integration in Greater Hartford through their involvement in the 1989 Sheff v O’Neill lawsuit. Previously, in the early 1970s, they became active in housing discrimination testing with Boyd Hinds and the Education/Instruccion organization. They also describe their experiences as West End residents and parents of children in the Hartford Public Schools, followed by their decision to move to suburban West Hartford in the mid-1990s, and the sharp differences in educational quality and student expectations between the two districts
The Complexity of Orbits of Computably Enumerable Sets
The goal of this paper is to announce there is a single orbit of the c.e.
sets with inclusion, \E, such that the question of membership in this orbit
is -complete. This result and proof have a number of nice
corollaries: the Scott rank of \E is \wock +1; not all orbits are
elementarily definable; there is no arithmetic description of all orbits of
\E; for all finite , there is a properly
orbit (from the proof).
A few small corrections made in this versionComment: To appear in the Bulletion of Symbolic Logi
On Characterizing Spector Classes
We study in this paper characterizations of various interesting classes of relations arising in recursion theory. We first determine which Spector classes on the structure of arithmetic arise from recursion in normal type 2 objects, giving a partial answer to a problem raised by Moschovakis [8], where the notion of Spector class was first
essentially introduced. Our result here was independently discovered by S. G. Simpson (see [3]). We conclude our study of Spector classes by examining two simple relations between them and a natural hierarchy to which they give rise
A Basis Result for Σ^0_3 Sets of Reals with an Application to Minimal Covers
It is shown that every ∑^0_3 set of reals which contains reals of arbitrarily high Turing degree in the hyperarithmetic hierarchy contains reals of every Turing degree above the degree of Kleene's O. As an application it is shown that every Turing degree above the Turing degree of Kleene's O is a minimal cover
Runnin\u27 Wild! / music by Harrington Gibbs and Leo Wood; words by Joe Gray
Cover: drawing of a running man; Publisher: Leo Feist Inc. (New York)https://egrove.olemiss.edu/sharris_d/1040/thumbnail.jp
Runnin\u27 Wild
https://digitalcommons.library.umaine.edu/mmb-vp/6157/thumbnail.jp
Models Without Indiscernibles Author
JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact [email protected]
Runnin\u27 Wild / music by Harrington Harris; words by Joe Grey and Leo Wood
An Ebony Jazz Tune (Cover). Key of Bb. Cover: a caricature of a man running; [Back page missing]; Publisher: Leo Feist Inc. (New York); Also includes Dusting the Keys (J. Edward Killalea and Edward B. Claypoole) and River Shannon Moon (Walter Wallace Smith)https://egrove.olemiss.edu/sharris_d/1043/thumbnail.jp
- …