Well quasi-ordered sets
From MaRDI portal
Publication:1803588
Recommendations
Cited in
(30)- Exact unprovability results for compound well-quasi-ordered combinatorial classes
- A Mechanized Proof of Higman’s Lemma by Open Induction
- A constructive picture of Noetherian conditions and well quasi-orders
- Partitionseigenschaft von endlichen Folgen
- 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 finite distinguishing number
- Well quasi orders in a categorical setting
- The ideal approach to computing closed subsets in well-quasi-orderings
- Representative properties of the quasi-ordered set $F(\alpha, M)$
- Proof pearl: a formal proof of Higman's lemma in ACL2
- scientific article; zbMATH DE number 3948340 (Why is no real title available?)
- Higman's lemma and its computational content
- Well-quasi-ordering and the Hausdorff quasi-uniformity
- scientific article; zbMATH DE number 3914378 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 558658 (Why is no real title available?)
- On well-quasi-ordering finite sequences
- Well-Quasi Orders and Hierarchy Theory
- scientific article; zbMATH DE number 1984521 (Why is no real title available?)
- Well quasi-orders and the functional interpretation
- A Decision Procedure for Regular Expression Equivalence in Type Theory
- Well-quasi-ordering hereditarily finite sets
- Well quasi-order in combinatorics: embeddings and homomorphisms
- A Theorem on Partial Well-Ordering of Sets of Vectors
- Infinitary Noetherian constructions I. Infinite words
- On operations and linear extensions of well partially ordered sets
- A linear time algorithm for monadic querying of indefinite data over linearly ordered domains
- Set systems: order types, continuous nondeterministic deformations, and quasi-orders
- A syntactic approach to the MacNeille completion of \(\Lambda^\ast\), the free monoid over an ordered alphabet \(\Lambda\)
- scientific article; zbMATH DE number 4170966 (Why is no real title available?)
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)