Muutke küpsiste eelistusi

E-raamat: Polygraphs: From Rewriting to Higher Categories

(Université Claude Bernard Lyon 1), (Université Paris Cité), (Université Paris Cité), (École Polytechnique, Paris), (Aix-Marseille Université), (Université Paris Cité)
  • Formaat - PDF+DRM
  • Hind: 111,15 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

This book, intended for PhD students and researchers, revisits the theory of rewriting and presentations of algebraic structures, through the unified approach provided by polygraphs, and put it in the context of homotopical algebra. It introduces the theory step-by-step using low-dimensional illustrations, providing detailed proofs.

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.

Muu info

The first book to use the unified approach provided by polygraphs to describe the theory of rewriting.
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.
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.