Well-Quasi Orders in Computation, Logic, Language and Reasoning
A Unifying Concept of Proof Theory, Automata Theory, Formal Languages and Descriptive Set Theory
Buch in deiner Nähe kaufen
Beschreibung
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.
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
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
Autor*in
Peter M. Schuster
Themen in »Well-Quasi Orders in Computation, Logic, Language and Reasoning«
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