<電子ブック>
Well-Quasi Orders in Computation, Logic, Language and Reasoning : A Unifying Concept of Proof Theory, Automata Theory, Formal Languages and Descriptive Set Theory / edited by Peter M. Schuster, Monika Seisenberger, Andreas Weiermann
(Trends in Logic, Studia Logica Library. ISSN:22127313 ; 53)
版 | 1st ed. 2020. |
---|---|
出版者 | (Cham : Springer International Publishing : Imprint: Springer) |
出版年 | 2020 |
大きさ | X, 391 p. 103 illus., 4 illus. in color : online resource |
著者標目 | Schuster, Peter M editor Seisenberger, Monika editor Weiermann, Andreas editor SpringerLink (Online service) |
件 名 | LCSH:Logic LCSH:Graph theory LCSH:Machine theory LCSH:Discrete mathematics LCSH:Logic design FREE:Logic FREE:Graph Theory FREE:Formal Languages and Automata Theory FREE:Discrete Mathematics FREE:Logic Design |
一般注記 | 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 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 HTTP:URL=https://doi.org/10.1007/978-3-030-30229-0 |
目次/あらすじ
所蔵情報を非表示
電子ブック | 配架場所 | 資料種別 | 巻 次 | 請求記号 | 状 態 | 予約 | コメント | ISBN | 刷 年 | 利用注記 | 指定図書 | 登録番号 |
---|---|---|---|---|---|---|---|---|---|---|---|---|
電子ブック | オンライン | 電子ブック |
|
Springer eBooks | 9783030302290 |
|
電子リソース |
|
EB00196987 |
類似資料
この資料の利用統計
このページへのアクセス回数:1回
※2017年9月4日以降