Please use this identifier to cite or link to this item:
Title: Regular graphs and the spectra of two-variable logic with counting
Authors: TAN, Tony 
Corporate Authors: Kopczýnski, Eryk
Issue Date: 2013
Abstract: The spectrum of a first-order logic sentence is the set of natural numbers that are cardinalities of its finite models. In this paper we show that when restricted to using only two variables, but allowing counting quantifiers, the spectra of first-order logic sentences are semilinear and hence, closed under complement. At the heart of our proof are semilinear characterisations for the existence of regular and biregular graphs, the class of graphs in which there are a priori bounds on the degrees of the vertices. Our proof also provides a simple characterisation of models of two-variable logic with counting -- that is, up to renaming and extending the relation names, they are simply a collection of regular and biregular graphs.
Keywords: two-variable logic with counting; first-order spectra; regular graphs; semi-linear; Presburger arithmetic
Document URI:
Link to publication:
Category: O
Type: Preprint
Appears in Collections:Research publications

Files in This Item:
File Description SizeFormat 
spectra-arxiv.pdf378.22 kBAdobe PDFView/Open
Show full item record

Page view(s)

checked on May 17, 2022


checked on May 17, 2022

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.