Téléchargez le livre : Well-Quasi Orders in Computation, Logic, Language and Reasoning

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

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

, ,

Éditeur :

Springer


Collection :

Trends in Logic

Paru le : 2020-01-01

eBook Téléchargement , DRM LCP 🛈 DRM Adobe 🛈
Lecture en ligne (streaming)
179,34 €
Téléchargement immédiat
Dès validation de votre commande
Image Louise Reader présentation

Louise Reader

Lisez ce titre sur l'application Louise Reader.

badge apple Application Louise Reader
badge Android Application Louise Reader
Description

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.
Pages
391 pages
Collection
Trends in Logic
Parution
2020-01-01
Marque
Springer
EAN papier
9783030302283
EAN PDF
9783030302290
Informations sur l'ebook
Nombre pages copiables
3
Nombre pages imprimables
39
Taille du fichier
5734 Ko
Prix
179,34 €
EAN EPUB
9783030302290
Informations sur l'ebook
Nombre pages copiables
3
Nombre pages imprimables
39
Taille du fichier
31611 Ko
Prix
179,34 €

Suggestions personnalisées