Logic, Language, Information, and Computation
Logic, Language, Information, and Computation
复制标题
逻辑、语言、信息和计算
DOI:
10.1007/978-3-662-52921-8_12
复制
发表时间:
2016
期刊:
影响因子:
--
通讯作者:
Dawar A
中科院分区:
文献类型:
--
作者:
Dawar A
Two graphs are co-spectral if their respective adjacency matrices have the same multi-set of eigenvalues. A graph is said to be determined by its spectrum if all graphs that are co-spectral with it are isomorphic to it. We consider these properties in relation to logical definability. We show that any pair of graphs that are elementarily equivalent with respect to the three-variable counting first-order logicare co-spectral, and this is not the case with, nor with any number of variables if we exclude counting quantifiers. We also show that the class of graphs that are determined by their spectra is definable in partial fixed-point logic with counting. We relate these properties to other algebraic and combinatorial problems.
登录
查看更多内容
DOI:
--
发表时间:
2002
期刊:
Studia Logica: An International Journal for Symbolic Logic
影响因子:
--
作者:
V. M. Abrusci
通讯作者:
V. M. Abrusci
DOI:
10.1145/1094622.1094629
发表时间:
2005
期刊:
ACM Trans. Comput. Log.
影响因子:
--
作者:
Dominic J. D. Hughes;R. V. Glabbeek
通讯作者:
R. V. Glabbeek
DOI:
--
发表时间:
2016
期刊:
影响因子:
--
作者:
Paul;Thomas;Ehrhard;J. Girard;P. Ruet;P. Scott
通讯作者:
P. Scott
影响因子:
0.3
作者:
Roberto Maieli
通讯作者:
Roberto Maieli
DOI:
--
发表时间:
2009
期刊:
影响因子:
--
作者:
T. Jandrok
通讯作者:
T. Jandrok