Switch to: References

Add citations

You must login to add citations.
  1. Generalizations of enumeration reducibility using recursive infinitary propositional sentences.C. J. Ash - 1992 - Annals of Pure and Applied Logic 58 (3):173-184.
    Ash, C.J., Generalizations of enumeration reducibility using recursive infinitary propositional sentences, Annals of Pure and Applied Logic 58 173–184. We consider the relation between sets A and B that for every set S if A is Σ0α in S then B is Σ0β in S. We show that this is equivalent to the condition that B is definable from A in a particular way involving recursive infinitary propositional sentences. When α = β = 1, this condition is that B is (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • On the Symmetric Enumeration Degrees.Charles M. Harris - 2007 - Notre Dame Journal of Formal Logic 48 (2):175-204.
    A set A is symmetric enumeration (se-) reducible to a set B (A ≤\sb se B) if A is enumeration reducible to B and \barA is enumeration reducible to \barB. This reducibility gives rise to a degree structure (D\sb se) whose least element is the class of computable sets. We give a classification of ≤\sb se in terms of other standard reducibilities and we show that the natural embedding of the Turing degrees (D\sb T) into the enumeration degrees (D\sb e) (...)
    Download  
     
    Export citation  
     
    Bookmark