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

DOI10.1016/j.tcs.2011.08.010zbMath1235.68090arXiv1112.2801OpenAlexW2962706254MaRDI QIDQ653312

Yohji Akama

Publication date: 9 January 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1112.2801

zbMATH Keywords

finite elasticitygameRamsey's theoremorder typefinitely branching simulationshuffle-closure

Mathematics Subject Classification ID

Computational learning theory (68Q32) Combinatorics in computer science (68R05) Applications of game theory (91A80)

Related Items (1)

The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderings

Cites Work

• Developments from enquiries into the learnability of the pattern languages from positive data
• Learning indexed families of recursive languages from positive data: A survey
• Topological properties of concept spaces (full version)
• From wqo to bqo, via Ellentuck's theorem
• Classical recursion theory. Vol. II
• Logic, language and computation. Festschrift in Honor of Satoru Takasu
• Ordinal mind change complexity of language identification
• Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data
• Mind change efficient learning
• The theory of well-quasi-ordering: a frequently discovered concept
• Commutative Regular Shuffle Closed Languages, Noetherian Property, and Learning Theory
• Algebraic Theory of Automata and Languages
• Reverse mathematics and the equivalence of definitions for well and better quasi-orders
• Ordering by Divisibility in Abstract Algebras
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Set systems: order types, continuous nondeterministic deformations, and quasi-orders