Well-quasi Orders in Computation, Logic, Language and Reasoning: A Unifying Concept of Proof Theory, Automata Theory, Formal Languages and Descriptive Set Theory

Schuster, Peter M. (Editor)/ Seisenberger, Monika (Editor)/ Weiermann, Andreas (Editor)

ISBN 10: 3030302288 / ISBN 13: 9783030302283

Published by Springer Verlag, 2020

About this Item

401 pages. 9.25x6.10x1.06 inches. In Stock.

Seller Inventory # x-3030302288

Bibliographic Details

• Title: Well-quasi Orders in Computation, Logic, Language and Reasoning: A Unifying Concept of Proof Theory, Automata Theory, Formal Languages and Descriptive Set Theory
• Publisher: Springer Verlag
• Publication Date: 2020
• Language: English
• ISBN 10: 3030302288
• ISBN 13: 9783030302283
• Binding: Hardcover
• Condition: Brand New

About this title

Synopsis

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.

About the Author

Peter Schuster is an Associate Professor of Mathematical Logic at the University of Verona. After completing both his doctorate and habilitation in mathematics at the University of Munich, he was a Lecturer at the University of Leeds and member of the Leeds Logic Group. Apart from constructive mathematics in general, his principal research interests are in the computational content of classical proofs in abstract algebra and related fields, in which maximum or minimum principles are invoked.

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.