2373 search results - page 30 / 475 » On the Theory of Structural Subtyping |
110
click to vote
FOSSACS
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We lay the foundations of a first-order correspondence theory for coalgebraic logics that makes the transition structure explicit in the first-order modelling. In parti...
CSL
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. It it shown that the first-order theory of an automatic structure, whose Gaifman graph has bounded degree, is decidable in doubly exponential space (for injective automa...
STACS
2005
Springer
15 years 3 months ago
2005
Springer
Dynamic complexity investigates the required effort to maintain knowledge about a property of a structure under changing operations. This article introduces a refined notion of ...
MOC
2000
14 years 9 months ago
2000
We consider sequences of s
ITA
2008
14 years 9 months ago
2008
We prove that there exists a structure M whose monadic second order theory is decidable, and such that the elementary theory of every expansion of M by a constant is undecidable. 1...