The computational strength of matchings in countable graphs

Annals of Pure and Applied Logic 173 (8):103133 (2022)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 94,452

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Recursive coloration of countable graphs.Hans-Georg Carstens & Peter Päppinghaus - 1983 - Annals of Pure and Applied Logic 25 (1):19-45.
Splitting into degrees with low computational strength.Rod Downey & Keng Meng Ng - 2018 - Annals of Pure and Applied Logic 169 (8):803-834.
A-computable graphs.Matthew Jura, Oscar Levin & Tyler Markkanen - 2016 - Annals of Pure and Applied Logic 167 (3):235-246.
Interaction graphs: Graphings.Thomas Seiller - 2017 - Annals of Pure and Applied Logic 168 (2):278-320.
Interaction graphs: Additives.Thomas Seiller - 2016 - Annals of Pure and Applied Logic 167 (2):95-154.
Reducts of the Henson graphs with a constant.András Pongrácz - 2017 - Annals of Pure and Applied Logic 168 (7):1472-1489.
On countable locally described structures.Berthold J. Maier - 1987 - Annals of Pure and Applied Logic 35 (C):205-246.

Analytics

Added to PP
2022-04-30

Downloads
10 (#1,228,616)

6 months
4 (#1,050,668)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Subsystems of Second Order Arithmetic.Stephen G. Simpson - 1999 - Studia Logica 77 (1):129-129.
Completion of choice.Vasco Brattka & Guido Gherardi - 2021 - Annals of Pure and Applied Logic 172 (3):102914.
Embeddings between well-orderings: Computability-theoretic reductions.Jun Le Goh - 2020 - Annals of Pure and Applied Logic 171 (6):102789.

View all 9 references / Add more references