Well-Quasi Orders in Computation, Logic, Language and Reasoning: A Unifying Concept of Proof Theory, Automata Theory, Formal Languages and Descriptive Set Theory (1st ed. 2020) (Trends in Logic #53)

By: and and

Sign Up Now! Already a Member? Log In
You must be logged into Bookshare to access this title. Learn about membership options, or view our freely available titles.

Synopsis
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.
Copyright:
2020

Book Details

Book Quality:
Publisher Quality
ISBN-13:
9783030302290
Related ISBNs:
9783030302283
Publisher:
Springer International Publishing
Date of Addition:
Copyrighted By:
Springer
Adult content:
No
Language:
English
Has Image Descriptions:
No
Categories:
Nonfiction, Computers and Internet, Mathematics and Statistics, Philosophy
Submitted By:
Bookshare Staff
Usage Restrictions:
This is a copyrighted book.
Edited by:
Peter M. Schuster
Edited by:
Monika Seisenberger
Edited by:
Andreas Weiermann

Reviews

No Rating Yet