- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
A jump inversion theorem for the enumeration jump
Archive for Mathematical Logic 39 (6):417-437 (2000)
Abstract
. We prove a jump inversion theorem for the enumeration jump and a minimal pair type theorem for the enumeration reducibilty. As an application some results of Selman, Case and Ash are obtainedMy notes
Similar books and articles
Badness and jump inversion in the enumeration degrees.Charles M. Harris - 2012 - Archive for Mathematical Logic 51 (3-4):373-406.
Limit lemmas and jump inversion in the enumeration degrees.Evan J. Griffiths - 2003 - Archive for Mathematical Logic 42 (6):553-562.
The jump operation for structure degrees.V. Baleva - 2005 - Archive for Mathematical Logic 45 (3):249-265.
On the jump classes of noncuppable enumeration degrees.Charles M. Harris - 2011 - Journal of Symbolic Logic 76 (1):177 - 197.
On the Symmetric Enumeration Degrees.Charles M. Harris - 2007 - Notre Dame Journal of Formal Logic 48 (2):175-204.
Goodness in the enumeration and singleton degrees.Charles M. Harris - 2010 - Archive for Mathematical Logic 49 (6):673-691.
On Nondeterminism, Enumeration Reducibility and Polynomial Bounds.Kate Copestake - 1997 - Mathematical Logic Quarterly 43 (3):287-310.
The limitations of cupping in the local structure of the enumeration degrees.Mariya I. Soskova - 2010 - Archive for Mathematical Logic 49 (2):169-193.
Branching in the $${\Sigma^0_2}$$ -enumeration degrees: a new perspective. [REVIEW]Maria L. Affatato, Thomas F. Kent & Andrea Sorbi - 2008 - Archive for Mathematical Logic 47 (3):221-231.
Noncappable enumeration degrees below 0'e. [REVIEW]S. Barry Cooper & Andrea Sorbi - 1996 - Journal of Symbolic Logic 61 (4):1347 - 1363.
Bounded enumeration reducibility and its degree structure.Daniele Marsibilio & Andrea Sorbi - 2012 - Archive for Mathematical Logic 51 (1-2):163-186.
The jump operator on the ω-enumeration degrees.Hristo Ganchev & Ivan N. Soskov - 2009 - Annals of Pure and Applied Logic 160 (3):289-301.
Analytics
Added to PP
2013-11-23
Downloads
34 (#458,553)
6 months
8 (#342,364)
2013-11-23
Downloads
34 (#458,553)
6 months
8 (#342,364)
Historical graph of downloads
Citations of this work
Computable Abelian groups.Alexander G. Melnikov - 2014 - Bulletin of Symbolic Logic 20 (3):315-356,.
A structural dichotomy in the enumeration degrees.Hristo A. Ganchev, Iskander Sh Kalimullin, Joseph S. Miller & Mariya I. Soskova - 2022 - Journal of Symbolic Logic 87 (2):527-544.
The jump operator on the ω-enumeration degrees.Hristo Ganchev & Ivan N. Soskov - 2009 - Annals of Pure and Applied Logic 160 (3):289-301.
A structural dichotomy in the enumeration degrees.Hristo A. Ganchev, Iskander Sh Kalimullin, Joseph S. Miller & Mariya I. Soskova - 2020 - Journal of Symbolic Logic:1-18.
The jump operation for structure degrees.V. Baleva - 2005 - Archive for Mathematical Logic 45 (3):249-265.
References found in this work
Partial degrees and the density problem. Part 2: The enumeration degrees of the ∑2 sets are dense.S. B. Cooper - 1984 - Journal of Symbolic Logic 49 (2):503 - 513.
Jumps of quasi-minimal enumeration degrees.Kevin McEvoy - 1985 - Journal of Symbolic Logic 50 (3):839-848.
On minimal pairs of enumeration degrees.Kevin McEvoy & S. Barry Cooper - 1985 - Journal of Symbolic Logic 50 (4):983-1001.
Generalizations of enumeration reducibility using recursive infinitary propositional sentences.C. J. Ash - 1992 - Annals of Pure and Applied Logic 58 (3):173-184.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-7c76586df8-5tf24 uwo