Expressive completeness through logically tractable models
Expressive completeness through logically tractable models
复制标题
通过逻辑上易于处理的模型表达完整性
DOI:
10.1016/j.apal.2013.06.017
复制
发表时间:
2013
期刊:
影响因子:
--
通讯作者:
M. Otto
中科院分区:
文献类型:
--
作者:
M. Otto
How can we prove that some fragment of a given logic has the power to define precisely all structural properties that satisfy some characteristic semantic preservation condition? This issue is a fundamental one for classical model theory and applications in non-classical settings alike. While methods differ greatly, and while the classical methods can usually not be matched for instance in the setting of finite model theory, this note surveys some interesting commonality revolving around the use and availability of tractable representatives in the relevant model classes. The construction of models in which simple invariants like partial types based on some weak fragment control all the relevant structural properties, may be seen at the heart of such questions. We highlight some constructions involving degrees of acyclicity and saturation that can be achieved in finite model constructions, and discuss their uses towards expressive completeness w.r.t. bisimulation based equivalences in hypergraphs and relational structures. The emphasis is on the combinatorial challenges in such more constructive approaches that work in non-classical settings and especially in finite model theory. One new result concerns expressive completeness w.r.t. guarded negation bisimulation, a back-and-forth equivalence involving local homomorphisms.
登录
查看更多内容
DOI:
10.1145/1379759.1379763
发表时间:
2008
期刊:
J. ACM
影响因子:
--
作者:
Benjamin Rossman
通讯作者:
Benjamin Rossman
DOI:
--
发表时间:
2006
期刊:
影响因子:
--
作者:
M. Otto
通讯作者:
M. Otto
影响因子:
0.6
作者:
I. Hodkinson;M. Otto
通讯作者:
M. Otto
DOI:
10.1007/3-540-61604-7_60
发表时间:
1996-08
期刊:
--
影响因子:
--
作者:
David Janin;I. Walukiewicz
通讯作者:
David Janin;I. Walukiewicz
DOI:
--
发表时间:
1997
期刊:
Journal of Logic, Language and Information
影响因子:
--
作者:
Eric Rosen
通讯作者:
Eric Rosen