TY - JOUR

T1 - A new order theory of set systems and better quasi-orderings

AU - Akama, Yohji

PY - 2012/3

Y1 - 2012/3

N2 - By reformulating a learning process of a set system L as a game between Teacher (presenter of data) and Learner (updater of abstract independent set), we define the order type dim L of L to be the order type of the game tree. The theory of this new order type and continuous, monotone function between set systems corresponds to the theory of well quasi-orderings (WQOs). As Nash-Williams developed the theory of WQOs to the theory of better quasiorderings (BQOs), we introduce a set system that has order type and corresponds to a BQO. We prove that the class of set systems corresponding to BQOs is closed by any monotone function. In (Shinohara and Arimura. "Inductive inference of unbounded unions of pattern languages from positive data." Theoretical Computer Science, pp. 191-209, 2000), for any set system L, they considered the class of arbitrary (finite) unions of members of L. From view point of WQOs and BQOs, we characterize the set systems L such that the class of arbitrary (finite) unions of members of L has order type. The characterization shows that the order structure of the set system L with respect to the set inclusion is not important for the resulting set system having order type. We point out continuous, monotone function of set systems is similar to positive reduction to Jockusch-Owings' weakly semirecursive sets.

AB - By reformulating a learning process of a set system L as a game between Teacher (presenter of data) and Learner (updater of abstract independent set), we define the order type dim L of L to be the order type of the game tree. The theory of this new order type and continuous, monotone function between set systems corresponds to the theory of well quasi-orderings (WQOs). As Nash-Williams developed the theory of WQOs to the theory of better quasiorderings (BQOs), we introduce a set system that has order type and corresponds to a BQO. We prove that the class of set systems corresponding to BQOs is closed by any monotone function. In (Shinohara and Arimura. "Inductive inference of unbounded unions of pattern languages from positive data." Theoretical Computer Science, pp. 191-209, 2000), for any set system L, they considered the class of arbitrary (finite) unions of members of L. From view point of WQOs and BQOs, we characterize the set systems L such that the class of arbitrary (finite) unions of members of L has order type. The characterization shows that the order structure of the set system L with respect to the set inclusion is not important for the resulting set system having order type. We point out continuous, monotone function of set systems is similar to positive reduction to Jockusch-Owings' weakly semirecursive sets.

KW - Better elasticity

KW - Continuous deformation

KW - Linearization

KW - Powerset orderings

KW - Unbounded unions

KW - Wqo

UR - http://www.scopus.com/inward/record.url?scp=84866461538&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84866461538&partnerID=8YFLogxK

U2 - 10.2201/NiiPi.2012.9.3

DO - 10.2201/NiiPi.2012.9.3

M3 - Article

AN - SCOPUS:84866461538

SN - 1349-8614

SP - 9

EP - 18

JO - Progress in Informatics

JF - Progress in Informatics

IS - 9

ER -