Towards better: A motivated introduction to better-quasi-orders

@article{Pequignot2016TowardsBA,
  title={Towards better: A motivated introduction to better-quasi-orders},
  author={Yann Pequignot},
  journal={arXiv: Logic},
  year={2016},
  volume={4},
  pages={185-218}
}
  • Yann Pequignot
  • Published 2016
  • Computer Science, Mathematics
  • arXiv: Logic
  • The well-quasi-orders (WQO) play an important role in various fields such as Computer Science, Logic or Graph Theory. Since the class of WQOs lacks closure under some important operations, the proof that a certain quasi-order is WQO consists often of proving it enjoys a stronger and more complicated property, namely that of being a better-quasi-order (BQO). Several articles contains valuable introductory material to the theory of BQOs. However, a textbook entitled "Introduction to better-quasi… CONTINUE READING
    2 Citations

    Figures and Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    References

    SHOWING 1-10 OF 42 REFERENCES
    The Theory of Well-Quasi-Ordering: A Frequently Discovered Concept
    • J. Kruskal
    • Mathematics, Computer Science
    • J. Comb. Theory, Ser. A
    • 1972
    • 311
    • PDF
    Better-quasi-order : ideals and spaces
    • 5
    • PDF
    Better quasi-orders for uncountable cardinals
    • 36
    On Fraisse's order type conjecture
    • 163
    Well-quasi-orderings and sets of finite sequences
    • 40
    Foundations of BQO theory
    • 52
    • PDF
    On the Quasi-Ordering of Borel Linear Orders under Embeddability
    • 29
    Basic WQO- and BQO-Theory
    • 90