Switch to: References

Add citations

You must login to add citations.
  1. The computational strength of matchings in countable graphs.Stephen Flood, Matthew Jura, Oscar Levin & Tyler Markkanen - 2022 - Annals of Pure and Applied Logic 173 (8):103133.
    Download  
     
    Export citation  
     
    Bookmark  
  • Searching problems above arithmetical transfinite recursion.Yudai Suzuki & Keita Yokoyama - 2024 - Annals of Pure and Applied Logic 175 (10):103488.
    Download  
     
    Export citation  
     
    Bookmark