Isbn: 9783030302313 - well-quasi orders in computation, logic, language and reasoning: a unifying concept of proof theory, automata theory, formal languages and descriptive set theory (trends in logic, band 53) (10 Ergebnisse)

Zustand: New. In English.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.…

Zustand: New. 1st ed. 2020 edition NO-PA16APR2015-KAP.

Paperback. Zustand: Brand New. 401 pages. 9.25x6.10x0.83 inches. In Stock.

Zustand: new. Questo è un articolo print on demand.

Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Peter Schuster is an Associate Professor of Mathematical Logic at the University of Verona. After completing both his doctorate and habilitation in mathematics at the University of Munich, he was a Lecturer at the University of Leeds and member . …

Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 404 pp. Englisch.…

Taschenbuch. Zustand: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Introduces readers to a highly active branch of combinatoricsSpringer-Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 404 pp. Englisch.

Zustand: New. Print on Demand.

Zustand: New. PRINT ON DEMAND.