國立虎尾科技大學 |

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 /
其他作者:	Weiermann, Andreas.
面頁冊數:	X, 391 p. 103 illus., 4 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Logic Design. -
電子資源:	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. - 1st ed. 2020. - X, 391 p. 103 illus., 4 illus. in color.online resource. - Trends in Logic, Studia Logica Library,531572-6126 ;. - Trends in Logic, Studia Logica Library,42.

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:

670915
Logic Design.

LC Class. No.: BC1-199

Dewey Class. No.: 160

Well-Quasi Orders in Computation, Logic, Language and Reasoning = A Unifying Concept of Proof Theory, Automata Theory, Formal Languages and Descriptive Set Theory /
LDR:03189nam a22004095i 4500 001 1020580
003 DE-He213
005 20200630070807.0
007 cr nn 008mamaa
008 210318s2020 gw | s |||| 0|eng d
020 $a 9783030302290 $9 978-3-030-30229-0
024 7 $a 10.1007/978-3-030-30229-0 $2 doi
035 $a 978-3-030-30229-0
050 4 $a BC1-199
072 7 $a HPL $2 bicssc
072 7 $a PHI011000 $2 bisacsh
072 7 $a QDTL $2 thema
082 0 4 $a 160 $2 23
245 1 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.
250 $a 1st ed. 2020.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2020.
300 $a X, 391 p. 103 illus., 4 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Trends in Logic, Studia Logica Library, $x 1572-6126 ; $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 2 4 $a Logic Design. $3 670915
650 2 4 $a Mathematical Logic and Formal Languages. $3 670059
650 2 4 $a Graph Theory. $3 786670
650 0 $a Logic design. $3 561473
650 0 $a Combinatorics. $3 669353
650 0 $a Mathematical logic. $2 bicssc $3 810627
650 0 $a Graph theory. $3 527884
650 0 $a Logic. $3 558909
700 1 $a Weiermann, Andreas. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1316085
700 1 $a Seisenberger, Monika. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1316084
700 1 $a Schuster, Peter M. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1298845
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030302283
776 0 8 $i Printed edition: $z 9783030302306
776 0 8 $i Printed edition: $z 9783030302313
830 0 $a Trends in Logic, Studia Logica Library, $x 1572-6126 ; $v 42 $3 1261075
856 4 0 $u https://doi.org/10.1007/978-3-030-30229-0
912 $a ZDB-2-SMA
912 $a ZDB-2-SXMS
950 $a Mathematics and Statistics (SpringerNature-11649)
950 $a Mathematics and Statistics (R0) (SpringerNature-43713)