A note on well quasi-orderings for powersets

DOI10.1016/S0020-0190(99)00149-0zbMath0998.06002OpenAlexW1989736956MaRDI QIDQ1607015

Petr Jančar

Publication date: 25 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(99)00149-0

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (9)

Reverse mathematics, well-quasi-orders, and Noetherian spaces ⋮ Better-quasi-orderings and coinduction ⋮ Infinitary Noetherian constructions I. Infinite words ⋮ Handling infinitely branching well-structured transition systems ⋮ The FEP for some varieties of fully distributive knotted residuated lattices ⋮ Fixed points and Noetherian topologies ⋮ Unnamed Item ⋮ The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderings ⋮ Well-structured transition systems everywhere!

Cites Work

• Unnamed Item
• Foundations of BQO Theory
• Ensuring completeness of symbolic verification methods for infinite-state systems

This page was built for publication: A note on well quasi-orderings for powersets