Descriptive complexity of graph spectra

, &
Annals of Pure and Applied Logic 170 (9):993-1007 (2019)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2019.04.005

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,031

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

On the complexity of finding the chromatic number of a recursive graph II: the unbounded case.Richard Beigel & William I. Gasarch - 1989 - Annals of Pure and Applied Logic 45 (3):227-246.
On the complexity of finding the chromatic number of a recursive graph I: the bounded case.Richard Beigel & William I. Gasarch - 1989 - Annals of Pure and Applied Logic 45 (1):1-38.
There is no recursive link between the k-size of a model and its cardinality.R. Barker - 2002 - Annals of Pure and Applied Logic 118 (3):235-247.
Ordinals and graph decompositions.Stephen Flood - 2017 - Annals of Pure and Applied Logic 168 (4):824-839.
The structure of random automorphisms of the random graph.Udayan B. Darji, Márton Elekes, Kende Kalina, Viktor Kiss & Zoltán Vidnyánszky - 2022 - Annals of Pure and Applied Logic 173 (9):103152.
An example of an automatic graph of intermediate growth.Alexei Miasnikov & Dmytro Savchuk - 2015 - Annals of Pure and Applied Logic 166 (10):1037-1048.
Fresh function spectra.Vera Fischer, Marlene Koelbing & Wolfgang Wohofsky - 2023 - Annals of Pure and Applied Logic 174 (9):103300.
A diamond example of an ordinal graph with no infinite paths.James E. Baumgartner & Jean A. Larson - 1990 - Annals of Pure and Applied Logic 47 (1):1-10.
A diamond example of an ordinal graph with no infinite paths.J. E. Baumgartner - 1990 - Annals of Pure and Applied Logic 47 (1):1.
Graph colorings and recursively bounded Π10-classes.J. B. Remmel - 1986 - Annals of Pure and Applied Logic 32:185-194.

Analytics

Added to PP
2019-04-13

Downloads
23 (#704,854)

6 months
11 (#271,985)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Probabilities on finite models.Ronald Fagin - 1976 - Journal of Symbolic Logic 41 (1):50-58.
How to define a linear order on finite models.Lauri Hella, Phokion G. Kolaitis & Kerkko Luosto - 1997 - Annals of Pure and Applied Logic 87 (3):241-267.

Add more references