Order:
  1.  18
    (1 other version)Bounds in the Turing reducibility of functions.Karol Habart & K. Habart - 1992 - Mathematical Logic Quarterly 38 (1):423-430.
    A hierarchy of functions with respect to their role as bounds in the Turing reducibility of functions is introduced and studied. This hierarchy leads to a certain notion of incompressibility of sets which is also investigated.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  2.  18
    (1 other version)On Absoluteness.Karol Habart - 1989 - Mathematical Logic Quarterly 35 (5):469-480.
    Direct download  
     
    Export citation  
     
    Bookmark  
  3.  26
    Bounds in weak truth-table reducibility.Karol Habart - 1991 - Notre Dame Journal of Formal Logic 32 (2):233-241.