86 search results - page 5 / 18 » Definability in Substructure Orderings, II: Finite Ordered S... |
JSYML
2002
13 years 7 months ago
2002
A propositional system of modal logic is second-order if it contains quantifiers p and p, which, in the standard interpretation, are construed as ranging over sets of possible worl...
JCT
2006
13 years 7 months ago
2006
A k-majority tournament T on a finite vertex set V is defined by a set of 2k - 1 linear orderings of V, with u v if and only if u lies above v in at least k of the orders. Motiva...
DLT
2004
13 years 8 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...
VVS
1998
IEEE
13 years 11 months ago
1998
IEEE
A visibility ordering of a set of objects, from a given viewpoint, is a total order on the objects such that if object a obstructs object b, then b precedes a in the ordering. Suc...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
This article studies the expressive power of finite automata recognizing sets of real numbers encoded in positional notation. We consider Muller automata as well as the restricted ...