株式会社極東書店トップ ＞ 商品一覧 ＞ Well-Quasi Orders in Computation, Logic, Language and Reasoning: A Unifying Concept of Proof Theory, Automata Theory, Formal Languages and Descriptive Set Theory. 2020 ed.
商品詳細
Well-Quasi Orders in Computation, Logic, Language and Reasoning: A Unifying Concept of Proof Theory, Automata Theory, Formal Languages and Descriptive Set Theory. 2020 ed.
・ISBN 978-3-030-30228-3 hard EUR 169.99
￥45,437.- (税込) ※（※）価格はご注文時の参考価格となります。
納品価格につきましては書籍の入荷時点で確定となります。
版元の原価改定、外国為替の変動等により異なる場合がございますので、予めご了承下さい。
| 著者・編者 | Schuster, Peter M. / Seisenberger, Monika / Weiermann, Andreas (eds.), |
|---|---|
| シリーズ | (Trends in Logic) |
| 出版社 | (Springer Nature Switzerland AG, SZ) |
| 出版年月 | 2020 |
| ページ数 | 391 pp. |
| 言語 | ENG |
| ニュース番号 | ＜A02-76719＞ |
解説
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.