62 search results - page 1 / 13 » On the logical definability of certain graph and poset langu... |
112
Voted
CORR
2006
Springer
15 years 8 days ago
2006
Springer
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...
71
Voted
ENTCS
2002
15 years 1 days ago
2002
Abstract. We extend some of our previous results on fixed points of graph multifunctions to posets. The posets of most interest here are the (finite) Khalimsky spaces, in their spe...
110
Voted
IJAC
2010
14 years 9 months ago
2010
We give an algebraic characterization of the tree languages that are defined by logical formulas using certain Lindstr
93
Voted
EJC
2006
15 years 7 days ago
2006
We study the positive Bergman complex B+ (M) of an oriented matroid M, which is a certain subcomplex of the Bergman complex B(M) of the underlying unoriented matroid M. The positiv...
122
Voted
CIE
2009
Springer
15 years 4 months ago
2009
Springer
An arithmetic circuit is a labelled, directed, acyclic graph specifying a cascade of arithmetic and logical operations to be performed on sets of non-negative integers. In this pap...