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 Jahr

DOI10.1007/978-3-030-30229-0MaRDI QIDQ5236465zbMATH OpenOpenAlexFDO

Authors

Publication date 8 October 2019

Published in Trends in Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-30229-0

Mathematics Subject Classification ID

Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations (03-06) Proof theory and constructive mathematics (03Fxx) Total orders (06A05) Set theory (03Exx)

Recommendations

• Towards better: a motivated introduction to better-quasi-orders
• Well-Quasi Orders and Hierarchy Theory
• Well Quasi-orders in Formal Language Theory
• Well quasi-ordered sets
• Well quasi-order in combinatorics: embeddings and homomorphisms

Cited in

(1)

• Well quasi orders in a categorical setting

This page was built for publication: 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 Jahr

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