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.
Book Details
Format
Hardback or Cased Book
Book Series
Trends in Logic
ISBN-10
3030302288
ISBN-13
9783030302283
Edition
2020 ed.
Publisher
Springer Nature Switzerland AG
Imprint
Springer Nature Switzerland AG
Country of Manufacture
GB
Country of Publication
GB
Publication Date
Jan 3rd, 2020
Print length
391 Pages
Weight
762 grams
Dimensions
16.30 x 24.20 x 2.90 cms
Ksh 28,800.00
Werezi Extended Catalogue
0 in stock
Delivery Location
Delivery fee: Select location
Secure
Quality
Fast
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 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.
Get Well-Quasi Orders in Computation, Logic, Language and Reasoning by at the best price and quality guaranteed only at Werezi Africa's largest book ecommerce store. The book was published by Springer Nature Switzerland AG and it has pages.