• Fri frakt över 249 kr
  • •
  • Snabba leveranser
  • •
  • Billiga böcker
Kundservice

Du är på sajten för privatpersoner.

Företag, bibliotek eller offentlig verksamhet?

Du handlar på classic.bokus.com, där alla dina funktioner finns intakta.
Till classic.bokus.com
Bokus logotyp. Gå till startsidan.
  • Erbjudanden
  • Student
  • Topplistor
  • Barn & ungdom
  • Bokus Play
  • E-böcker
  • Ljudböcker
  • Pocketböcker
  • Spel och pussel

Pocketfynda! Hundratals böcker för 49 kr/st →

Sidfot

Mina sidor

    Hjälp

    • Kundservice
    • Vanliga frågor och svar
    • Frakt och leverans
    • Retur vid ångerrätt
    • Reklamera vara
    • Betalning
    • Köpvillkor
    • Allmänna villkor
    • Information om webbplatsens tillgänglighet

    Om Bokus

    • Om oss
    • Pressrum
    • För studenter
    • För företag
    • För bibliotek och offentlig verksamhet
    • För leverantörer
    • Hållbarhet

    Populärt

    • Aktuella erbjudanden
    • Presentkort
    • Studentlitteratur
    • Nya böcker
    • Topplistor
    • Signerade böcker
    • Engelska böcker

    Inspiration

    • Boktips
    • BookTok
    • Barnbokskaraktärer
    • Populära författare
    Logotyp för Bokus
    Följ oss på Facebook (extern länk)Följ oss på Instagram (extern länk)Följ oss på YouTube (extern länk)Följ oss på TikTok (extern länk)
    bokus @ CookiesAnpassa cookiesIntegritetspolicyKöpvillkor
    Till Citymail hemsida (extern länk)Till Budbee hemsida (extern länk)Till Postnord hemsida (extern länk)Till Schenker hemsida (extern länk)Till Early Bird hemsida (extern länk)Till Walleys hemsida (extern länk)
    1. Data och IT
    2. Systemvetenskap och AI

    Polygraphs: From Rewriting to Higher Categories

    AvDimitri Ara,Albert Burroni

    Häftad, Engelska, 2025

    Del 495 i serien London Mathematical Society Lecture Note Series

    1 217 kr

    Beställningsvara. Skickas inom 7-10 vardagar. Fri frakt över 249 kr.

    Beskrivning

    This is the first book to revisit the theory of rewriting in the context of strict higher categories, through the unified approach provided by polygraphs, and put it in the context of homotopical algebra. The first half explores the theory of polygraphs in low dimensions and its applications to the computation of the coherence of algebraic structures. Illustrated with algorithmic computations on algebraic structures, the only prerequisite in this section is basic category theory. The theory is introduced step-by-step, with detailed proofs. The second half introduces and studies the general notion of n-polygraph, before addressing the homotopy theory of these polygraphs. It constructs the folk model structure on the category on strict higher categories and exhibits polygraphs as cofibrant objects. This allows the formulation of higher-dimensional generalizations of the coherence results developed in the first half. Graduate students and researchers in mathematics and computer science will find this work invaluable.

    Produktinformation

    • Utgivningsdatum:2025-04-03
    • Mått:151 x 227 x 31 mm
    • Vikt:1 040 g
    • Format:Häftad
    • Språk:Engelska
    • Serie:London Mathematical Society Lecture Note Series
    • Antal sidor:666
    • Förlag:Cambridge University Press
    • ISBN:9781009498982

    Utforska kategorier

    • Systemvetenskap och AI inom Data och IT
    • Topologi inom Naturvetenskap och teknik
    • Matematikens grunder inom Naturvetenskap och teknik

    Mer om författaren

    Dimitri Ara is Associate Professor at Aix-Marseille Université. Albert Burroni is Associate Researcher at Université Paris Cité. Yves Guiraud is Researcher at Université Paris Cité. Philippe Malbos is Professor at Université Claude Bernard Lyon 1. Francois Métayer is Associate Professor Emeritus at Université Paris Cité. Samuel Mimram is Professor at the LIX laboratory of École Polytechnique.

    Innehållsförteckning

    • Part I. Fundamentals of Rewriting: 1. Abstract rewriting and one-dimensional polygraphs; 2. Two-dimensional polygraphs; 3. Operations on presentations; 4. String rewriting and 2-polygraphs; 5. Tietze transformations and completion; 6. Linear rewriting; Part II. Coherent Presentations: 7. Coherence by convergence; 8. Categories of finite derivation type; 9. Homological syzygies and confluence; Part III. Diagram Rewriting: 10. Three-dimensional polygraphs; 11. Termination of 3-polygraphs; 12. Coherent presentations of 2-categories; 13. Term rewriting systems; Part IV. Polygraphs: 14. Higher categories; 15. Polygraphs; 16. Properties of the category of 𝑛-polygraphs; 17. A catalogue of 𝑛-polygraphs; 18. Generalized polygraphs; Part V. Homotopy Theory of Polygraphs; 19. Polygraphic resolutions; 20. Towards the folk model structure; 21. The folk model structure; 22. Homology of 𝜔-categories; 23. Resolutions by (𝜔, 1)-polygraphs; Appendix A. A catalogue of 2-polygraphs; Appendix B. Examples of coherent presentations of monoids; Appendix C. A catalogue of 3-polygraphs; Appendix D. A syntactic description of free 𝑛-categories; Appendix E. Complexes and homology; Appendix F. Homology of categories; Appendix G. Locally presentable categories; Appendix H. Model categories; References; Index of notations; Index of terminology.Part I. Fundamentals of Rewriting: 1. Abstract rewriting and one-dimensional polygraphs; 2. Two-dimensional polygraphs; 3. Operations on presentations; 4. String rewriting and 2-polygraphs; 5. Tietze transformations and completion; 6. Linear rewriting; Part II. Coherent Presentations: 7. Coherence by convergence; 8. Categories of finite derivation type; 9. Homological syzygies and confluence; Part III. Diagram Rewriting: 10. Three-dimensional polygraphs; 11. Termination of 3-polygraphs; 12. Coherent presentations of 2-categories; 13. Term rewriting systems; Part IV. Polygraphs: 14. Higher categories; 15. Polygraphs; 16. Properties of the category of 𝑛-polygraphs; 17. A catalogue of 𝑛-polygraphs; 18. Generalized polygraphs; Part V. Homotopy Theory of Polygraphs: 19. Polygraphic resolutions; 20. Towards the folk model structure; 21. The folk model structure; 22. Homology of 𝜔-categories; 23. Resolutions by (𝜔, 1)-polygraphs; Appendix A. A catalogue of 2-polygraphs; Appendix B. Examples of coherent presentations of monoids; Appendix C. A catalogue of 3-polygraphs; Appendix D. A syntactic description of free 𝑛-categories; Appendix E. Complexes and homology; Appendix F. Homology of categories; Appendix G. Locally presentable categories; Appendix H. Model categories; References; Index of notations; Index of terminology.