Well-Quasi Orders in Computation, Logic, Language and Reasoning
Introduces readers to a highly active branch of combinatoricsUnifies interdisciplinary areas between logic, mathematics and computer scienceHighlights relevant work by top scholars from various fields
ISBN: | 9783030302283 |
---|---|
Sprache: | Englisch |
Seitenzahl: | 391 |
Produktart: | Gebunden |
Herausgeber: | Schuster, Peter M. Seisenberger, Monika Weiermann, Andreas |
Verlag: | Springer International Publishing |
Veröffentlicht: | 03.01.2020 |
Untertitel: | A Unifying Concept of Proof Theory, Automata Theory, Formal Languages and Descriptive Set Theory |
Schlagworte: | Combinatorics Descriptive Set Theory Graph-minor Theorem Graph Theory Maximal Order Type Ordinal Notation System Proof Theory Reverse Mathematics Termination Proofs Well Quasi-order |
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.