The computational strength of matchings in countable graphs

Stephen Flood, Matthew Jura, Oscar Levin, Tyler Markkanen. The computational strength of matchings in countable graphs. Annals of Pure and Applied Logic, 173(8):103133, 2022. [doi]

Abstract

Abstract is missing.