東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Well-quasi orders in computation, lo...

Schuster, Peter M.

FindBook

Google Book

Amazon

博客來

Well-quasi orders in computation, logic, language and reasoning = a unifying concept of proof theory, automata theory, formal languages and descriptive set theory /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Well-quasi orders in computation, logic, language and reasoning/ edited by Peter M. Schuster, Monika Seisenberger, Andreas Weiermann.
其他題名:	a unifying concept of proof theory, automata theory, formal languages and descriptive set theory /
其他作者:	Schuster, Peter M.
出版者:	Cham :Springer International Publishing : : 2020.,
面頁冊數:	x, 391 p. :ill., digital ;24 cm.
內容註:	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.
Contained By:	Springer eBooks
標題:	Combinatorial analysis. -
電子資源:	https://doi.org/10.1007/978-3-030-30229-0
ISBN:	9783030302290

Well-quasi orders in computation, logic, language and reasoning = a unifying concept of proof theory, automata theory, formal languages and descriptive set theory /
Well-quasi orders in computation, logic, language and reasoninga unifying concept of proof theory, automata theory, formal languages and descriptive set theory /[electronic resource] :edited by Peter M. Schuster, Monika Seisenberger, Andreas Weiermann. - Cham :Springer International Publishing :2020. - x, 391 p. :ill., digital ;24 cm. - Trends in logic, Studia Logica library,v.531572-6126 ;. - Trends in logic, Studia Logica library ;v.53..

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.

ISBN: 9783030302290

Standard No.: 10.1007/978-3-030-30229-0doiSubjects--Topical Terms:

523878
Combinatorial analysis.

LC Class. No.: QA164 / .W455 2020

Dewey Class. No.: 511.6

Well-quasi orders in computation, logic, language and reasoning = a unifying concept of proof theory, automata theory, formal languages and descriptive set theory /
LDR:02800nmm a2200337 a 4500 001 2215229
003 DE-He213
005 20200520094958.0
006 m d
007 cr nn 008maaau
008 201119s2020 sz s 0 eng d
020 $a 9783030302290 $q (electronic bk.)
020 $a 9783030302283 $q (paper)
024 7 $a 10.1007/978-3-030-30229-0 $2 doi
035 $a 978-3-030-30229-0
040 $a GP $c GP
041 0 $a eng
050 4 $a QA164 $b .W455 2020
072 7 $a HPL $2 bicssc
072 7 $a PHI011000 $2 bisacsh
072 7 $a QDTL $2 thema
082 0 4 $a 511.6 $2 23
090 $a QA164 $b .W447 2020
245 0 0 $a Well-quasi orders in computation, logic, language and reasoning $h [electronic resource] : $b a unifying concept of proof theory, automata theory, formal languages and descriptive set theory / $c edited by Peter M. Schuster, Monika Seisenberger, Andreas Weiermann.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2020.
300 $a x, 391 p. : $b ill., digital ; $c 24 cm.
490 1 $a Trends in logic, Studia Logica library, $x 1572-6126 ; $v v.53
505 0 $a 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.
520 $a 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.
650 0 $a Combinatorial analysis. $3 523878
650 0 $a Set theory. $3 520081
650 1 4 $a Logic. $3 529544
650 2 4 $a Graph Theory. $3 1567033
650 2 4 $a Mathematical Logic and Formal Languages. $3 892517
650 2 4 $a Combinatorics. $3 895617
650 2 4 $a Logic Design. $3 892735
700 1 $a Schuster, Peter M. $3 3446474
700 1 $a Seisenberger, Monika. $3 3446475
700 1 $a Weiermann, Andreas. $3 3446476
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
830 0 $a Trends in logic, Studia Logica library ; $v v.53. $3 3446477
856 4 0 $u https://doi.org/10.1007/978-3-030-30229-0
950 $a Mathematics and Statistics (Springer-11649)