2373 search results - page 30 / 475 » On the Theory of Structural Subtyping |
191
click to vote
FOSSACS
2010
Springer
16 years 1 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...
131
click to vote
CSL
2009
Springer
16 years 23 days 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...
158
click to vote
STACS
2005
Springer
15 years 11 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 ...
154
click to vote
ITA
2008
15 years 6 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...