Well quasi-ordered sets

DOI10.1006/AIMA.1993.1004zbMATH Open0771.03020OpenAlexW2051505231MaRDI QIDQ1803588FDOQ1803588

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

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

zbMATH Keywords

constructive mathematicsfinite sequenceswell-quasi-ordered sets

Mathematics Subject Classification ID

Other constructive mathematics (03F65)

Cited In (30)

• Higman's lemma and its computational content
• Title not available (Why is that?)
• A Decision Procedure for Regular Expression Equivalence in Type Theory
• Title not available (Why is that?)
• A Mechanized Proof of Higman’s Lemma by Open Induction
• Well quasi orders in a categorical setting
• A constructive picture of Noetherian conditions and well quasi-orders
• A linear time algorithm for monadic querying of indefinite data over linearly ordered domains
• What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory
• On well-quasi-ordering finite sequences
• Well quasi-order in combinatorics: embeddings and homomorphisms
• Proof pearl: a formal proof of Higman's lemma in ACL2
• Well-quasi-ordering and the Hausdorff quasi-uniformity
• 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
• Exact unprovability results for compound well-quasi-ordered combinatorial classes
• Well-quasi-ordering hereditarily finite sets
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Theorem on Partial Well-Ordering of Sets of Vectors
• Partitionseigenschaft von endlichen Folgen
• Well-Quasi Orders and Hierarchy Theory
• Well quasi-orders and the functional interpretation
• Set systems: order types, continuous nondeterministic deformations, and quasi-orders
• Representative properties of the quasi-ordered set $F(\alpha, M)$
• Title not available (Why is that?)
• Infinitary Noetherian constructions I. Infinite words
• On operations and linear extensions of well partially ordered sets
• A syntactic approach to the MacNeille completion of \(\Lambda^\ast\), the free monoid over an ordered alphabet \(\Lambda\)
• Well‐quasi‐ordering and finite distinguishing number
• The ideal approach to computing closed subsets in well-quasi-orderings

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)