JCT
1998
13 years 10 months ago
1998
We introduce a concept of so-called disjoint ordering for any collection of finite sets. It can be viewed as a generalization of a system of distinctive representatives for the s...
CORR
2007
Springer
13 years 10 months ago
2007
Springer
We consider a new kind of interpretation over relational structures: finite sets interpretations. Those interpretations are defined by weak monadic second-order (WMSO) formulas w...
BIRTHDAY
2004
Springer
14 years 4 months ago
2004
Springer
We present a new proof that languages generated by (non extended) H systems with finite sets of axioms and rules are regular.
DALT
2005
Springer
14 years 4 months ago
2005
Springer
An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this se...