Bounded degree and planar spectra.
LOGICAL METHODS IN COMPUTER SCIENCE(2017)
摘要
The finite spectrum of a first-order sentence is the set of positive integers that are the sizes of its models. The class of finite spectra is known to be the same as the complexity class NE. We consider the spectra obtained by limiting models to be either planar (in the graph-theoretic sense) or by bounding the degree of elements. We show that the class of such spectra is still surprisingly rich by establishing that significant fragments of NE are included among them. At the same time, we establish non-trivial upper bounds showing that not all sets in NE are obtained as planar or bounded-degree spectra.
更多查看译文
关键词
spectra,finite model theory,planar graphs,bounded degree graphs
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络