Set systems: Order types, continuous nondeterministic deformations, and quasi-orders

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

Abstract

By reformulating a learning process of a set system L as a game between Teacher and Learner, we define the order type of L to be the order type of the game tree, if the tree is well-founded. The features of the order type of L (dim L in symbol) are (1) we can represent any well-quasi-order (WQO for short) by the set system L of the upper-closed sets of the WQO such that the maximal order type of the WQO is equal to dim L; (2) dim L is an upper bound of the mind-change complexity of L. dim L is defined iff L has a finite elasticity (FE for short), where, according to computational learning theory, if an indexed family of recursive languages has FE then it is learnable by an algorithm from positive data. Regarding set systems as subspaces of Cantor spaces, we prove that FE of set systems is preserved by any continuous function which is monotone with respect to the setinclusion. By it, we prove that finite elasticity is preserved by various (nondeterministic) language operators (Kleene-closure, shuffle-closure, union, product, intersection,⋯). The monotone continuous functions represent nondeterministic computations. If a monotone continuous function has a computation tree with each node followed by at most n immediate successors and the order type of a set system L is α, then the direct image of L is a set system of order type at most n-adic diagonal Ramsey number of α. Furthermore, we provide an order-type-preserving contravariant embedding from the category of quasiorders and finitely branching simulations between them, into the complete category of subspaces of Cantor spaces and monotone continuous functions having Girard's linearity between them.

Original languageEnglish
Pages (from-to)6235-6251
Number of pages17
JournalTheoretical Computer Science
Volume412
Issue number45
DOIs
Publication statusPublished - 2011 Oct 21

Keywords

  • Finite elasticity
  • Finitely branching simulation
  • Game
  • Order type
  • Ramsey's theorem
  • Shuffle-closure

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Set systems: Order types, continuous nondeterministic deformations, and quasi-orders'. Together they form a unique fingerprint.

Cite this