16 search results - page 1 / 4 » A Logic on Subobjects and Recognizability |
67
Voted
IFIPTCS
2010
14 years 8 months ago
2010
We introduce a simple logic that allows to quantify over the subobjects of a categorical object. We subsequently show that, for the category of graphs, this logic is equally expres...
IANDC
2006
14 years 10 months ago
2006
We study several algebras of graphs and hypergraphs and the corresponding notions of equational sets and recognizable sets. We generalize and unify several existing results which ...
91
Voted
DLT
2004
14 years 11 months ago
2004
New results on the recognizability of sets of finite graphs, hypergraphs and relational structures are presented. The general framework of this research which associates tightly a...
103
Voted
CORR
2006
Springer
14 years 10 months 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...
CSR
2006
Springer
15 years 3 days ago
2006
Springer
Abstract. We study a quantitative model of traces, i.e. trace series which assign to every trace an element from a semiring. We show the coincidence of recognizable trace series wi...