Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    UID:
    gbv_1689105399
    Format: 1 Online-Ressource (X, 391 p. 103 illus., 4 illus. in color.)
    ISBN: 9783030302290
    Series Statement: Trends in logic, studia logica library volume 53
    Content: 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.
    Content: 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.
    Additional Edition: ISBN 9783030302283
    Additional Edition: ISBN 9783030302306
    Additional Edition: ISBN 9783030302313
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 9783030302283
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 9783030302306
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 9783030302313
    Language: English
    Keywords: Beweistheorie ; Automatentheorie ; Formale Sprache ; Deskriptive Mengenlehre
    Author information: Seisenberger, Monika 1968-
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages