Algebraic properties of ω-trees (II)

Abstract

In [16] we defined the concept of ω-labeled tree as a binary, ordered and labeled tree with several features concerning the labels and order between the direct descendants of a node. This paper includes several further results concerning these structures. The main results presented in this paper are the following: we introduce an equivalence relation ≃ on the set OBT(ω) of ω-trees and a partial order on the factor set OBT(ω)/ ≃.