DocumentCode :
1616106
Title :
Spectrum hierarchies and subdiagonal functions
Author :
Hunter, Aaron
Author_Institution :
Dept. of Comput. Sci., Simon Fraser Univ., Burnaby, BC, Canada
fYear :
2003
Firstpage :
281
Lastpage :
290
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.
Keywords :
formal logic; functions; theorem proving; cardinality set; closure property; finite model; first-order structure; spectra subclass; spectrum hierarchy; subdiagonal function; Complexity theory; Computer science; Logic; Polynomials;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Logic in Computer Science, 2003. Proceedings. 18th Annual IEEE Symposium on
ISSN :
1043-6871
Print_ISBN :
0-7695-1884-2
Type :
conf
DOI :
10.1109/LICS.2003.1210068
Filename :
1210068
Link To Document :
بازگشت