search for books and compare prices
Patrick Dehornoy has written 3 work(s)
Search for other authors with the same name
displaying 1 to 3 | at end
show results in order: alphabetically | oldest to newest | newest to oldest
Cover for 9783037191392 Cover for 9780817663438 Cover for 9783764363437 Cover for 9783034895682 Cover for 9783540568995
Foundations of Garside Theory
cover image for 9783037191392
Product Description: This text is a monograph on algebra, with connections to geometry and low-dimensional topology. It mainly involves groups, monoids, and categories, and aims to provide a unified treatment for those situations in which one can find distinguished decompositions by iteratively extracting a maximal fragment lying in a prescribed family...read more
By Patrick Dehornoy
See complete details on each edition (1 edition listed)

Hardcover:

9783037191392 | European Mathematical Society, May 15, 2015, cover price $119.00 | About this edition: This text is a monograph on algebra, with connections to geometry and low-dimensional topology.

Braids and Self-Distributivity
cover image for 9783034895682
By Patrick Dehornoy
See complete details on each edition (3 editions listed)

Hardcover:

9783764363437 | Birkhauser, November 1, 2000, cover price $139.00
9780817663438 | Birkhauser, July 1, 2000, cover price $104.00

Paperback:

9783034895682 | Birkhauser, October 23, 2012, cover price $139.00

Complexité Et Décidabilité/ Complexity and Decidability
cover image for 9783540568995
Product Description: Cet ouvrage présente les bases de la théorie de la complexité des algorithmes et en derive les théorèmes fondamentaux de décidabilité et d'indécidabilité pour la logique et l'arithmétique, dont le premier théorème d'incomplétude de Gödel...read more
By Patrick Dehornoy
See complete details on each edition (1 edition listed)

Paperback:

9783540568995, titled "Complexité Et Décidabilité/ Complexity and Decidability" | Springer Verlag, September 10, 1993, cover price $79.95 | About this edition: Cet ouvrage présente les bases de la théorie de la complexité des algorithmes et en derive les théorèmes fondamentaux de décidabilité et d'indécidabilité pour la logique et l'arithmétique, dont le premier théorème d'incomplétude de Gödel.

displaying 1 to 3 | at end