Sciweavers

CORR
2006
Springer
144views Education» more  CORR 2006»
14 years 15 days ago
On the logical definability of certain graph and poset languages
We show that it is equivalent, for certain sets of finite graphs, to be definable in CMS (counting monadic second-order, a natural extension of monoadic second-order logic), and t...
Pascal Weil