Well-Quasi Orders in Computation, Logic, Language and Reasoning

A Unifying Concept of Proof Theory, Automata Theory, Formal Languages and Descriptive Set Theory

By: Peter M. Schuster (Editor), Monika Seisenberger (Editor), Andreas Weiermann (Editor)

Write A Review

Hardcover | 3 January 2020

At a Glance

Hardcover
404 Pages

Dimensions(cm)
23.39 x 15.6 x 2.39

Hardcover

$322.96

or 4 interest-free payments of $80.74 with

or

Aims to ship in 7 to 10 business days

When will this arrive by?
Enter delivery postcode to estimate

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.

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.