Switch to: References

Add citations

You must login to add citations.
  1. Some theorems on the algorithmic approach to probability theory and information theory:(1971 dissertation directed by AN Kolmogorov).Leonid A. Levin - 2010 - Annals of Pure and Applied Logic 162 (3):224-235.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • On the (semi)lattices induced by continuous reducibilities.Arno Pauly - 2010 - Mathematical Logic Quarterly 56 (5):488-502.
    Continuous reducibilities are a proven tool in Computable Analysis, and have applications in other fields such as Constructive Mathematics or Reverse Mathematics. We study the order-theoretic properties of several variants of the two most important definitions, and especially introduce suprema for them. The suprema are shown to commutate with several characteristic numbers.
    Download  
     
    Export citation  
     
    Bookmark   11 citations