Well-Quasi Orders in Computation, Logic, Language and Reasoning
Produktnummer:
18c91e6f8d25434e239d3cef6a085241bf
| Themengebiete: | Combinatorics Descriptive Set Theory Graph-minor Theorem Graph Theory Maximal Order Type Ordinal Notation System Proof Theory Reverse Mathematics Termination Proofs Well Quasi-order |
|---|---|
| Veröffentlichungsdatum: | 03.01.2020 |
| EAN: | 9783030302283 |
| Sprache: | Englisch |
| Seitenzahl: | 391 |
| Produktart: | Gebunden |
| Herausgeber: | Schuster, Peter M. Seisenberger, Monika Weiermann, Andreas |
| Verlag: | Springer International Publishing |
| Untertitel: | A Unifying Concept of Proof Theory, Automata Theory, Formal Languages and Descriptive Set Theory |
Produktinformationen "Well-Quasi Orders in Computation, Logic, Language and Reasoning"
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.
Sie möchten lieber vor Ort einkaufen?
Sie haben Fragen zu diesem oder anderen Produkten oder möchten einfach gerne analog im Laden stöbern? Wir sind gerne für Sie da und beraten Sie auch telefonisch.
Juristische Fachbuchhandlung
Georg Blendl
Parcellistraße 5 (Maxburg)
8033 München
Montag - Freitag: 8:15 -18 Uhr
Samstags geschlossen