218 search results - page 1 / 44 » Finite Trees as Ordinals |
CIE
2005
Springer
14 years 4 months ago
2005
Springer
BSL
2005
13 years 10 months ago
2005
We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length to computations on tapes of arbitrary ordinal length. We show that a ...
AIML
2008
14 years 9 days ago
2008
We generalise some results of [7, 5] and show that if L is an -modal logic (for some ordinal 3) such that (i) L contains the product logic K and (ii) the product of -many trees o...
TALG
2008
13 years 10 months ago
2008
We introduce a new notion of embedding, called minimum-relaxation ordinal embedding, parallel to the standard notion of minimum-distortion (metric) embedding. In an ordinal embedd...
ALGORITHMICA
1999
13 years 10 months ago
1999
Sequence data for a group of species is often summarized by a distance matrix M where M[s, t] is the dissimilarity between the sequences of species s and t. An ordinal assertion is...