Switch to: References

Add citations

You must login to add citations.
  1. Fine hierarchies via Priestley duality.Victor Selivanov - 2012 - Annals of Pure and Applied Logic 163 (8):1075-1107.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Turing reducibility in the fine hierarchy.Alexander G. Melnikov, Victor L. Selivanov & Mars M. Yamaleev - 2020 - Annals of Pure and Applied Logic 171 (7):102766.
    Download  
     
    Export citation  
     
    Bookmark  
  • A syntactic approach to Borel functions: some extensions of Louveau’s theorem.Takayuki Kihara & Kenta Sasaki - 2023 - Archive for Mathematical Logic 62 (7):1041-1082.
    Louveau showed that if a Borel set in a Polish space happens to be in a Borel Wadge class $$\Gamma $$, then its $$\Gamma $$ -code can be obtained from its Borel code in a hyperarithmetical manner. We extend Louveau’s theorem to Borel functions: If a Borel function on a Polish space happens to be a $$ \underset{\widetilde{}}{\varvec{\Sigma }}\hbox {}_t$$ -function, then one can find its $$ \underset{\widetilde{}}{\varvec{\Sigma }}\hbox {}_t$$ -code hyperarithmetically relative to its Borel code. More generally, we prove (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • 1999 European Summer Meeting of the Association for Symbolic Logic.Wilfrid Hodges - 2000 - Bulletin of Symbolic Logic 6 (1):103-137.
    Download  
     
    Export citation  
     
    Bookmark