LEADER 04335nam 22006975 450 001 9910482968603321 005 20200630070807.0 010 $a3-030-30229-6 024 7 $a10.1007/978-3-030-30229-0 035 $a(CKB)4940000000158730 035 $a(DE-He213)978-3-030-30229-0 035 $a(MiAaPQ)EBC6005125 035 $a(PPN)242845460 035 $a(EXLCZ)994940000000158730 100 $a20200101d2020 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aWell-Quasi Orders in Computation, Logic, Language and Reasoning $eA Unifying Concept of Proof Theory, Automata Theory, Formal Languages and Descriptive Set Theory /$fedited by Peter M. Schuster, Monika Seisenberger, Andreas Weiermann 205 $a1st ed. 2020. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2020. 215 $a1 online resource (X, 391 p. 103 illus., 4 illus. in color.) 225 1 $aTrends in Logic, Studia Logica Library,$x1572-6126 ;$v53 311 $a3-030-30228-8 327 $aWell, Better, and in-between -- The Categorical Structure of Well-Quasi Orders -- On Kriz's Theorem -- On the Width of FAC Orders, a Somewhat Rediscovered Notion -- Preliminary Well-quasi Orders in the Study of Hierarchies and Reducibilities -- The Ideal Approach to Computing Closed Subsets in Well-Quasi-Orderings -- Well-Quasi Orders and Regularity -- Well Quasi Ordering and Embeddability of Relational Structures -- A Functional Interpretation of Zorn's Lemma and its Application in Well-Quasi-Order Theory -- The Reverse Mathematics of wqos and bqos -- Well-partial Ordering and the Maximal Order Type -- TBC -- The Worlds of Well-Partial-Orders and Ordinal Notation systems -- Bounds for the Strength of the Graph Minor Theorem. 330 $aThis book bridges the gaps between logic, mathematics and computer science by delving into the theory of well-quasi orders, also known as wqos. This highly active branch of combinatorics is deeply rooted in and between many fields of mathematics and logic, including proof theory, commutative algebra, braid groups, graph theory, analytic combinatorics, theory of relations, reverse mathematics and subrecursive hierarchies. As a unifying concept for slick finiteness or termination proofs, wqos have been rediscovered in diverse contexts, and proven to be extremely useful in computer science. The book introduces readers to the many facets of, and recent developments in, wqos through chapters contributed by scholars from various fields. As such, it offers a valuable asset for logicians, mathematicians and computer scientists, as well as scholars and students. 410 0$aTrends in Logic, Studia Logica Library,$x1572-6126 ;$v53 606 $aLogic 606 $aGraph theory 606 $aMathematical logic 606 $aCombinatorics 606 $aLogic design 606 $aLogic$3https://scigraph.springernature.com/ontologies/product-market-codes/E16000 606 $aGraph Theory$3https://scigraph.springernature.com/ontologies/product-market-codes/M29020 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 606 $aCombinatorics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29010 606 $aLogic Design$3https://scigraph.springernature.com/ontologies/product-market-codes/I12050 615 0$aLogic. 615 0$aGraph theory. 615 0$aMathematical logic. 615 0$aCombinatorics. 615 0$aLogic design. 615 14$aLogic. 615 24$aGraph Theory. 615 24$aMathematical Logic and Formal Languages. 615 24$aCombinatorics. 615 24$aLogic Design. 676 $a511.6 676 $a511.6 702 $aSchuster$b Peter M$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aSeisenberger$b Monika$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aWeiermann$b Andreas$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910482968603321 996 $aWell-Quasi Orders in Computation, Logic, Language and Reasoning$92185770 997 $aUNINA