Overview
- Introduces readers to a highly active branch of combinatorics
- Unifies interdisciplinary areas between logic, mathematics and computer science
- Highlights relevant work by top scholars from various fields
Part of the book series: Trends in Logic (TREN, volume 53)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (13 chapters)
-
Front Matter
Keywords
- Well Quasi-order
- Combinatorics
- Graph Theory
- Proof Theory
- Descriptive Set Theory
- Maximal Order Type
- Ordinal Notation System
- Reverse Mathematics
- Graph-minor Theorem
- Termination Proofs
- constructive mathematics
- computational content of classical proofs
- Theorem Proving and Verification
- discrete mathematics
- commutative algebra
- braid groups
- analytic combinatorics
- subrecursive hierarchies
- theory of relations
- Kriz's Theorem
About this book
This 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.
Editors and Affiliations
About the editors
Monika Seisenberger is an Associate Professor of Computer Science at Swansea University. After completing a PhD in the Graduate Programme “Logic in Computer Science” at the LMU Munich she took up a position as research assistant at Swansea University, where she was subsequently appointed lecturer and later programme director. Her research focuses on logic, and on theorem proving and verification.
Andreas Weiermann is a FullProfessor of Mathematics at Ghent University. After completing both his doctorate and habilitation in mathematics at the University of Münster, he held postdoctoral positions in Münster and Utrecht and became first an Associate Professor and later Full Professor in Ghent. His research interests include proof theory, theoretical computer science and discrete mathematics.
Bibliographic Information
Book Title: Well-Quasi Orders in Computation, Logic, Language and Reasoning
Book Subtitle: A Unifying Concept of Proof Theory, Automata Theory, Formal Languages and Descriptive Set Theory
Editors: Peter M. Schuster, Monika Seisenberger, Andreas Weiermann
Series Title: Trends in Logic
DOI: https://doi.org/10.1007/978-3-030-30229-0
Publisher: Springer Cham
eBook Packages: Mathematics and Statistics, Mathematics and Statistics (R0)
Copyright Information: Springer Nature Switzerland AG 2020
Hardcover ISBN: 978-3-030-30228-3Published: 03 January 2020
Softcover ISBN: 978-3-030-30231-3Published: 26 August 2021
eBook ISBN: 978-3-030-30229-0Published: 01 January 2020
Series ISSN: 1572-6126
Series E-ISSN: 2212-7313
Edition Number: 1
Number of Pages: X, 391
Number of Illustrations: 99 b/w illustrations, 4 illustrations in colour
Topics: Logic, Graph Theory, Mathematical Logic and Formal Languages, Combinatorics, Logic Design