Well-Quasi Orders in Computation, Logic, Language and Reasoning
Springer International Publishing (Verlag)
978-3-030-30228-3 (ISBN)
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.
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 Full Professor 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.
Well, 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.
| Erscheinungsdatum | 25.01.2020 |
|---|---|
| Reihe/Serie | Trends in Logic |
| Zusatzinfo | X, 391 p. 103 illus., 4 illus. in color. |
| Verlagsort | Cham |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 742 g |
| Themenwelt | Geisteswissenschaften ► Philosophie ► Allgemeines / Lexika |
| Geisteswissenschaften ► Philosophie ► Logik | |
| Schlagworte | Analytic Combinatorics • Braid Groups • combinatorics • Commutative algebra • computational content of classical proofs • Constructive Mathematics • descriptive set theory • Discrete Mathematics • Graph-minor Theorem • graph theory • Kriz's Theorem • Maximal Order Type • Ordinal Notation System • Proof theory • reverse mathematics • subrecursive hierarchies • termination proofs • Theorem Proving and Verification • theory of relations • Well Quasi-order |
| ISBN-10 | 3-030-30228-8 / 3030302288 |
| ISBN-13 | 978-3-030-30228-3 / 9783030302283 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
