A note on well quasi-orderings for powersets

DOI10.1016/S0020-0190(99)00149-0zbMATH Open0998.06002OpenAlexW1989736956WikidataQ127846668 ScholiaQ127846668MaRDI QIDQ1607015FDOQ1607015

Authors: 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

Recommendations

• Fine analysis of the quasi-orderings on the power set
• Well quasi ordering finite posets and formal languages
• On well-quasi-ordering finite sequences
• On well quasiordering of finite languages
• Well (and better) quasi-ordered transition systems

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Ensuring completeness of symbolic verification methods for infinite-state systems
• Foundations of BQO Theory

Cited In (13)

• Fixed points and Noetherian topologies
• Reverse mathematics, well-quasi-orders, and Noetherian spaces
• Better-quasi-orderings and coinduction
• Title not available (Why is that?)
• Fine analysis of the quasi-orderings on the power set
• Regular separability of well-structured transition systems
• Well-structured transition systems everywhere!
• Well rewrite orderings and well quasi-orderings
• Handling infinitely branching well-structured transition systems
• The FEP for some varieties of fully distributive knotted residuated lattices
• A characterization of Plotkin's order in powerdomains, and some of its properties
• Infinitary Noetherian constructions I. Infinite words
• The ideal approach to computing closed subsets in well-quasi-orderings

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1607015)