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)

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2022.103133

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,174

External links

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

Through your library

My notes

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.
Harvey M. Friedman, Stephen G. Simpson, and Rick L. Smith. Countable algebra and set existence axioms. Annals of pure and applied logic, vol. 25 , pp. 141–181. - Harvey M. Friedman, Stephen G. Simpson, and Rick L. Smith. Addendum to “Countable algebra and set existence axioms.” Annals of pure and applied logic, vol. 28 , pp. 319–320. [REVIEW]Peter G. Clote - 1987 - Journal of Symbolic Logic 52 (1):276-278.
Splitting into degrees with low computational strength.Rod Downey & Keng Meng Ng - 2018 - Annals of Pure and Applied Logic 169 (8):803-834.
Measurable perfect matchings for acyclic locally countable borel graphs.Clinton T. Conley & Benjamin D. Miller - 2017 - Journal of Symbolic Logic 82 (1):258-271.
A-computable graphs.Matthew Jura, Oscar Levin & Tyler Markkanen - 2016 - Annals of Pure and Applied Logic 167 (3):235-246.
The monadic second-order logic of graphs IV: Definability properties of equational graphs.Bruno Courcelle - 1990 - Annals of Pure and Applied Logic 49 (3):193.
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.
Universal graphs and functions on ω1.Saharon Shelah & Juris Steprāns - 2021 - Annals of Pure and Applied Logic 172 (8):102986.

Analytics

Added to PP
2022-04-30

Downloads
15 (#1,237,203)

6 months
4 (#1,255,690)

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 8 references / Add more references