Graduate studies at Western
Journal of Symbolic Logic 55 (2):637-644 (1990)
|Abstract||We introduce the notion of "semi-r.e." for subsets of ω, a generalization of "semirecursive" and of "r.e.", and the notion of "weakly semirecursive", a generalization of "semi-r.e.". We show that A is weakly semirecursive iff, for any n numbers x 1 ,...,x n , knowing how many of these numbers belong to A is equivalent to knowing which of these numbers belong to A. It is shown that there exist weakly semirecursive sets that are neither semi-r.e. nor co-semi-r.e. On the other hand, we exhibit nonzero Turing degrees in which every weakly semirecursive set is semirecursive. We characterize the notion "A is weakly semirecursive and recursive in K" in terms of recursive approximations to A. We also show that if a finite Boolean combination of r.e. sets is semirecursive then it must be r.e. or co-r.e. Several open questions are raised|
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
Karl Auinger, Gracinda M. S. Gomes, Victoria Gould & Benjamin Steinberg (2004). An Application of a Theorem of Ash to Finite Covers. Studia Logica 78 (1-2):45 - 57.
Jouko Väänänen (1982). Abstract Logic and Set Theory. II. Large Cardinals. Journal of Symbolic Logic 47 (2):335-346.
James Cain & Zlatan Damnjanovic (1991). On the Weak Kleene Scheme in Kripke's Theory of Truth. Journal of Symbolic Logic 56 (4):1452-1468.
Steven Buechler (1988). The Classification of Small Weakly Minimal Sets. II. Journal of Symbolic Logic 53 (2):625-635.
B. Sh Kulpeshov (1998). Weakly o-Minimal Structures and Some of Their Properties. Journal of Symbolic Logic 63 (4):1511-1528.
Mariagnese Giusto & Stephen G. Simpson (2000). Located Sets and Reverse Mathematics. Journal of Symbolic Logic 65 (3):1451-1480.
Alfred Dolich, John Goodrick & David Lippel (2010). Dp-Minimality: Basic Facts and Examples. Notre Dame Journal of Formal Logic 52 (3):267-288.
Bektur Sembiuly Baizhanov (2001). Expansion of a Model of a Weakly o-Minimal Theory by a Family of Unary Predicates. Journal of Symbolic Logic 66 (3):1382-1414.
Richard Beigel, William Gasarch, Martin Kummer, Georgia Martin, Timothy McNicholl & Frank Stephan (2000). The Complexity of Oddan. Journal of Symbolic Logic 65 (1):1 - 18.
Frank Stephan (2001). On the Structures Inside Truth-Table Degrees. Journal of Symbolic Logic 66 (2):731-770.
Added to index2009-01-28
Total downloads3 ( #215,006 of 757,546 )
Recent downloads (6 months)0
How can I increase my downloads?