Atjaunināt sīkdatņu piekrišanu

Topological Duality for Distributive Lattices: Theory and Applications [Hardback]

(Université Paris Cité), (Université Cōte dAzur)
  • Formāts: Hardback, 367 pages, height x width x depth: 251x175x25 mm, weight: 800 g, Worked examples or Exercises
  • Sērija : Cambridge Tracts in Theoretical Computer Science
  • Izdošanas datums: 07-Mar-2024
  • Izdevniecība: Cambridge University Press
  • ISBN-10: 1009349694
  • ISBN-13: 9781009349697
  • Hardback
  • Cena: 87,22 €
  • Grāmatu piegādes laiks ir 3-4 nedēļas, ja grāmata ir uz vietas izdevniecības noliktavā. Ja izdevējam nepieciešams publicēt jaunu tirāžu, grāmatas piegāde var aizkavēties.
  • Daudzums:
  • Ielikt grozā
  • Piegādes laiks - 4-6 nedēļas
  • Pievienot vēlmju sarakstam
  • Formāts: Hardback, 367 pages, height x width x depth: 251x175x25 mm, weight: 800 g, Worked examples or Exercises
  • Sērija : Cambridge Tracts in Theoretical Computer Science
  • Izdošanas datums: 07-Mar-2024
  • Izdevniecība: Cambridge University Press
  • ISBN-10: 1009349694
  • ISBN-13: 9781009349697
Introducing Stone–Priestley duality theory and its applications to logic and theoretical computer science, this book equips graduate students and researchers with the theoretical background necessary for reading and understanding current research in the area. After giving a thorough introduction to the algebraic, topological, logical, and categorical aspects of the theory, the book covers two advanced applications in computer science, namely in domain theory and automata theory. These topics are at the forefront of active research seeking to unify semantic methods with more algorithmic topics in finite model theory. Frequent exercises punctuate the text, with hints and references provided.

This introduction to Stone–Priestley duality theory brings modern tools in the area together in textbook format for the first time and covers applications to logic and theoretical computer science. This book is for undergraduates, graduate students, and researchers in lattice theory, algebra, topology, logic, and theoretical computer science.

Recenzijas

'This book introduces efficiently Stone-Priestley duality theory for bounded distributive lattices, thereby laying solid mathematical foundations for applications in mathematics and computer science. Readers interested in the fields of domain theory and automata theory will see the general duality theory bearing fruit and opening doors to further applications.' Jorge Almeida, Universidade do Porto 'This book is a textbook and also a research monograph. For undergraduates there is the basic duality, for postgraduates, applications in algebra, topology and logic, and to theoretical computer science. Then, there are research themes to develop. The applications to CS are exciting and not published as a book before.' Mirna Damonja, IRIF, CNRS-Université de Paris 'Duality is an indispensable tool in logic and theoretical computer science, and this book provides a great introduction to it. It is very pleasant to read, and does a wonderful job explaining the key ideas. It is highly recommended to anyone entering the field.' Yde Venema, Universiteit van Amsterdam

Papildus informācija

Introduces lattice-theoretic and topological methods in logic and computer science, with applications in domain theory and automata theory.
Preface;
1. Order and lattices;
2. Topology and order;
3. Priestley duality;
4. Duality methods;
5. Categorical duality;
6. Omega-point duality;
7. Domain theory;
8. Automata theory; Bibliography; Notation; Index.
Mai Gehrke is directeur de recherches in computer science at the French National Centre for Scientific Research (CNRS) working at the department of mathematics of Université Cōte d'Azur in Nice. Her main contributions are in Stone duality, canonical extensions, and applications in logic and theoretical computer science. Sam van Gool is maītre de conférences at the Research Institute for Foundations of Computer Science (IRIF) at Université Paris Cité. His main contributions are in duality theory and logic in mathematics and computer science.