Well quasi-ordered sets

DOI10.1006/AIMA.1993.1004MaRDI QIDQ1803588zbMATH OpenOpenAlexFDO

Authors Fred Richman, Gabriel Stolzenberg

Publication date 29 June 1993

Published in Advances in Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/aima.1993.1004

zbMATH Keywords

constructive mathematicsfinite sequenceswell-quasi-ordered sets

Mathematics Subject Classification ID

Other constructive mathematics (03F65)

Review text

The theory of well-quasi-ordered sets is developed from a constructive point of view. In particular, it is shown that the set of finite sequences of elements from a well-quasi-ordered set is well quasi- ordered.

Recommendations

• On well-quasi-ordering finite sequences
• scientific article; zbMATH DE number 3914378
• Towards better: a motivated introduction to better-quasi-orders
• Well-Quasi Orders and Hierarchy Theory
• From wqo to bqo, via Ellentuck's theorem

Cited in

(35)

• Exact unprovability results for compound well-quasi-ordered combinatorial classes
• Partitionseigenschaft von endlichen Folgen
• On well-quasi-ordering finite sequences
• What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory
• Well-quasi-ordering and the Hausdorff quasi-uniformity
• Well quasi orders in a categorical setting
• On operations and linear extensions of well partially ordered sets
• On Scott's thesis for domains of information and well-quasi-orderings
• A linear time algorithm for monadic querying of indefinite data over linearly ordered domains
• A syntactic approach to the MacNeille completion of ^, the free monoid over an ordered alphabet
• Integer packing sets form a well-quasi-ordering
• Well-quasi-ordering hereditarily finite sets
• A Decision Procedure for Regular Expression Equivalence in Type Theory
• Well quasi-order in combinatorics: embeddings and homomorphisms
• A Theorem on Partial Well-Ordering of Sets of Vectors
• The ideal approach to computing closed subsets in well-quasi-orderings
• Well quasi-orders and the functional interpretation
• Well-Quasi Orders and Hierarchy Theory
• A Mechanized Proof of Higman’s Lemma by Open Induction
• Higman's lemma and its computational content
• scientific article; zbMATH DE number 4170966 (Why is no real title available?)
• Representative properties of the quasi-ordered set F(\alpha, M)
• scientific article; zbMATH DE number 3914378 (Why is no real title available?)
• scientific article; zbMATH DE number 3948340 (Why is no real title available?)
• scientific article; zbMATH DE number 25645 (Why is no real title available?)
• scientific article; zbMATH DE number 558658 (Why is no real title available?)
• A Combinatorial Approach to Complexity Theory via Ordinal Hierarchies
• Proof pearl: a formal proof of Higman's lemma in ACL2
• scientific article; zbMATH DE number 1984521 (Why is no real title available?)
• Well‐quasi‐ordering and finite distinguishing number
• Infinitary Noetherian constructions I. Infinite words
• Well-quasi orders in computation, logic, language and reasoning. A unifying concept of proof theory, automata theory, formal languages and descriptive set theory. Based on the minisymposium on well-quasi orders: from theory to applications within the Jahrestagung der Deutschen Mathematiker-Vereinigung (DMV), Hamburg, Germany, September 21--25, 2015 and the Dagstuhl seminar 16031 on well quasi-orders in computer science, Schloss Dagstuhl, Germany, January 17--22, 2016
• A constructive picture of Noetherian conditions and well quasi-orders
• Set systems: order types, continuous nondeterministic deformations, and quasi-orders
• A general constructive form of Higman's lemma

This page was built for publication: Well quasi-ordered sets

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