Leseprobe
* Affiliatelinks/Werbelinks
Links auf reinlesen.de sind sogenannte Affiliate-Links. Wenn du auf so einen Affiliate-Link klickst und über diesen Link einkaufst, bekommt reinlesen.de von dem betreffenden Online-Shop oder Anbieter eine Provision. Für dich verändert sich der Preis nicht.
Well-Quasi Orders in Computation, Logic, Language and Reasoning
Peter M. Schuster (Hrsg.), Monika Seisenberger (Hrsg.), Andreas Weiermann (Hrsg.)
* Affiliatelinks/Werbelinks
Links auf reinlesen.de sind sogenannte Affiliate-Links. Wenn du auf so einen Affiliate-Link klickst und über diesen Link einkaufst, bekommt reinlesen.de von dem betreffenden Online-Shop oder Anbieter eine Provision. Für dich verändert sich der Preis nicht.
Springer International Publishing 
Geisteswissenschaften, Kunst, Musik / Allgemeines, Lexika
Beschreibung
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.
Kundenbewertungen
Maximal Order Type, Descriptive Set Theory, Termination Proofs, Proof Theory, commutative algebra, computational content of classical proofs, braid groups, Reverse Mathematics, Kriz's Theorem, Ordinal Notation System, Combinatorics, Well Quasi-order, subrecursive hierarchies, theory of relations, Theorem Proving and Verification, analytic combinatorics, Graph-minor Theorem, discrete mathematics, Graph Theory, constructive mathematics