A note on first-order spectra with binary relations.

LOGICAL METHODS IN COMPUTER SCIENCE(2018)

引用 0|浏览47
暂无评分
摘要
The spectrum of a first-order sentence is the set of the cardinalities of its finite models. In this paper, we consider the spectra of sentences over binary relations that use at least three variables. We show that for every such sentence Phi, there is a sentence Phi' that uses the same number of variables, but only one symmetric binary relation, such that its spectrum is linearly proportional to the spectrum of Phi Moreover, the models of Phi' are all bipartite graphs. As a corollary, we obtain that to settle Asser's conjecture, i.e., whether the class of spectra is closed under complement, it is sufficient to consider only sentences using only three variables whose models are restricted to undirected bipartite graphs.
更多
查看译文
关键词
Non-deterministic exponential time,first-order spectra,three-variable logic,bipartite graphs
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要