Logic in Computer Science (LICS 2003)

Paper: Spectrum Hierarchies and Subdiagonal Functions (at LICS 2003)

Authors: Aaron Hunter

Abstract

The spectrum of a first-order sentence is the set of cardinalities of its finite models. Relatively little is known about the subclasses of spectra that are obtained by looking only at sentences with a specific signature. In this paper, we study natural subclasses of spectra and their closure properties under simple subdiagonal functions. We show that many natural closure properties turn out to be equivalent to the collapse of potential spectrum hierarchies. We prove all of our results using explicit transformations on first-order structures.

BibTeX

  @InProceedings{Hunter-SpectrumHierarchies,
    author = 	 {Aaron Hunter},
    title = 	 {Spectrum Hierarchies and Subdiagonal Functions},
    booktitle =  {Proceedings of the Eighteenth Annual IEEE Symp. on Logic in Computer Science, {LICS} 2003},
    year =	 2003,
    editor =	 {Phokion G. Kolaitis},
    month =	 {June}, 
    pages =      {281--290},
    location =   {Ottawa, Canada}, 
    publisher =	 {IEEE Computer Society Press}
  }