218 search results - page 5 / 44 » Finite Trees as Ordinals |
LOGCOM
2006
14 years 9 months ago
2006
Starting from a decomposition result of MTL-chains as ordinal sums, we focus our attention on a particular kind of indecomposable semihoops, namely weakly cancellative semihoops. ...
CLASSIFICATION
2006
14 years 10 months ago
2006
Abstract. Given a set of pairwise distances on a set of n points, constructing an edge-weighted tree whose leaves are these n points such that the tree distances would mimic the or...
FCT
2007
Springer
15 years 4 months ago
2007
Springer
We show that the family of tree languages recognized by weak alternating automata is closed by three set theoretic operations that correspond to sum, multiplication by ordinals <...
ACS
2008
14 years 10 months ago
2008
We show that the Priestley sum of finite trees contains no cyclic finite poset.
CIE
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. We prove that for any k 3 each element of the homomorphic quasiorder of finite k-labeled forests is definable, provided that the minimal non-smallest elements are allowe...