A-computable graphs

, &
Annals of Pure and Applied Logic 167 (3):235-246 (2016)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2015.11.003

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,865

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

Domatic partitions of computable graphs.Matthew Jura, Oscar Levin & Tyler Markkanen - 2014 - Archive for Mathematical Logic 53 (1-2):137-155.
Computability and the game of cops and robbers on graphs.Rachel D. Stahl - 2022 - Archive for Mathematical Logic 61 (3):373-397.
Degree Spectra of Analytic Complete Equivalence Relations.Dino Rossegger - 2022 - Journal of Symbolic Logic 87 (4):1663-1676.
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.
Pairs of computable structures.C. J. Ash & J. F. Knight - 1990 - Annals of Pure and Applied Logic 46 (3):211-234.
Interaction graphs: Graphings.Thomas Seiller - 2017 - Annals of Pure and Applied Logic 168 (2):278-320.
Computable Stone spaces.Nikolay Bazhenov, Matthew Harrison-Trainor & Alexander Melnikov - 2023 - Annals of Pure and Applied Logic 174 (9):103304.
Interaction graphs: Additives.Thomas Seiller - 2016 - Annals of Pure and Applied Logic 167 (2):95-154.
Recursive coloration of countable graphs.Hans-Georg Carstens & Peter Päppinghaus - 1983 - Annals of Pure and Applied Logic 25 (1):19-45.
Reducts of the Henson graphs with a constant.András Pongrácz - 2017 - Annals of Pure and Applied Logic 168 (7):1472-1489.

Analytics

Added to PP
2015-11-25

Downloads
24 (#906,477)

6 months
6 (#851,951)

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

Effective coloration.Dwight R. Bean - 1976 - Journal of Symbolic Logic 41 (2):469-480.
A minimal degree not realizing least possible jump.Leonard P. Sasso - 1974 - Journal of Symbolic Logic 39 (3):571-574.
The -spectrum of a linear order.Russell Miller - 2001 - Journal of Symbolic Logic 66 (2):470-486.
Recursive coloration of countable graphs.Hans-Georg Carstens & Peter Päppinghaus - 1983 - Annals of Pure and Applied Logic 25 (1):19-45.

View all 8 references / Add more references