Cantitate/Preț
Produs
Total produse
Vezi coșul
Well-Quasi Orders in Computation, Logic, Language and Reasoning: A Unifying Concept of Proof Theory, Automata Theory, Formal Languages and Descriptive Set Theory de Peter M. Schuster

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, cartea 53

Editat de Peter M. Schuster, Monika Seisenberger, Andreas Weiermann
en Limba Engleză Paperback – 26 aug 2021
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.

Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 111292 lei  6-8 săpt.
  Springer International Publishing – 26 aug 2021 111292 lei  6-8 săpt.
Hardback (1) 111908 lei  6-8 săpt.
  Springer International Publishing – 3 ian 2020 111908 lei  6-8 săpt.

Din seria Trends in Logic

Preț: 111292 lei

Preț vechi: 135721 lei
-18% Nou

Puncte Express: 1669
Preț estimativ în valută:
21301€ • 22154$ • 17850£

Carte tipărită la comandă

Livrare economică 13-27 martie

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783030302313
ISBN-10: 3030302318
Ilustrații: X, 391 p. 103 illus., 4 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.56 kg
Ediția:1st ed. 2020
Editura: Springer International Publishing
Colecția Springer
Seria Trends in Logic

Locul publicării:Cham, Switzerland

Cuprins

Well, Better, and in-between.- The Categorical Structure of Well-Quasi Orders.- On Kriz's Theorem.- On the Width of FAC Orders, a Somewhat Rediscovered Notion.- Preliminary Well-quasi Orders in the Study of Hierarchies and Reducibilities.- The Ideal Approach to Computing Closed Subsets in Well-Quasi-Orderings.- Well-Quasi Orders and Regularity.- Well Quasi Ordering and Embeddability of Relational Structures.- A Functional Interpretation of Zorn's Lemma and its Application in Well-Quasi-Order Theory.- The Reverse Mathematics of wqos and bqos.- Well-partial Ordering and the Maximal Order Type.- TBC.- The Worlds of Well-Partial-Orders and Ordinal Notation systems.- Bounds for the Strength of the Graph Minor Theorem.

Notă biografică

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 of the Leeds Logic Group. Apart from constructive mathematics in general, his principal research interests are in the computational content of classical proofs in abstract algebra and related fields, in which maximum or minimum principles are invoked.

Monika Seisenberger is an Associate Professor of Computer Science at Swansea University. After completing a PhD in the Graduate Programme “Logic in Computer Science” at the LMU Munich she took up a position as research assistant at Swansea University, where she was subsequently appointed lecturer and later programme director. Her research focuses on logic, and on theorem proving and verification.

Andreas Weiermann is a FullProfessor of Mathematics at Ghent University. After completing both his doctorate and habilitation in mathematics at the University of Münster, he held postdoctoral positions in Münster and Utrecht and became first an Associate Professor and later Full Professor in Ghent. His research interests include proof theory, theoretical computer science and discrete mathematics.

Textul de pe ultima copertă

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.

Caracteristici

Introduces readers to a highly active branch of combinatorics Unifies interdisciplinary areas between logic, mathematics and computer science Highlights relevant work by top scholars from various fields