Topological Duality for Distributive Lattices: Theory and Applications (Cambridge Tracts in Theoretical Computer Science, Series Number 61)

✍ Scribed by Mai Gehrke, Sam van Gool

Publisher: Cambridge University Press
Year: 2024
Tongue: English
Leaves: 369
Edition: 1
Category: Library

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

Topological Duality for Distributive Lat

📁 Topological Duality for Distributive Lattices: Theory and Applications (Cambridge Tracts in Theoretical Computer Science, Series Number 61)

✍ Mai Gehrke, Sam van Gool 📂 Library 📅 2024 🏛 Cambridge University Press 🌐 English

<span>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 introducti

Topological Duality for Distributive Lat

📁 Topological Duality for Distributive Lattices. Theory and Applications

✍ MAI GEHRKE, SAM VAN GOOL 📂 Library 📅 2024 🏛 Cambridge University Press 🌐 English

Extensions of First-Order Logic (Cambrid

📁 Extensions of First-Order Logic (Cambridge Tracts in Theoretical Computer Science, Series Number 19)

✍ Maria Manzano 📂 Library 📅 1996 🏛 Cambridge University Press 🌐 English

<span>Classical logic has proved inadequate in various areas of computer science, artificial intelligence, mathematics, philosopy and linguistics. This is an introduction to extensions of first-order logic, based on the principle that many-sorted logic (MSL) provides a unifying framework in which to

Topology, Domain Theory and Theoretical

📁 Topology, Domain Theory and Theoretical Computer Science

✍ Michael W. Mislove 📂 Library 📅 1997 🏛 Elsevier 🌐 English

Abstract In this paper, we survey the use of order-theoretic topology in theoretical computer science, with an emphasis on applications of domain theory. Our focus is on the uses of order-theoretic topology in programming language semantics, and on problems of potential interest to topologists t

Categories and Computer Science (Cambrid

📁 Categories and Computer Science (Cambridge Computer Science Texts, Series Number 28)

✍ R. F. C. Walters 📂 Library 📅 1992 🏛 Cambridge University Press 🌐 English

<span>Category Theory has, in recent years, become increasingly important and popular in computer science, and many universities now introduce Category Theory as part of the curriculum for undergraduate computer science students. Here, the theory is developed in a straightforward way, and is enriche

Finite Model Theory and Its Applications

📁 Finite Model Theory and Its Applications (Texts in Theoretical Computer Science. An EATCS Series)

✍ Erich Grädel, Phokion G. Kolaitis, Leonid Libkin, Maarten Marx, Joel Spencer, Mo 📂 Library 📅 2007 🏛 Springer 🌐 English

<span>Finite model theory,as understoodhere, is an areaof mathematicallogic that has developed in close connection with applications to computer science, in particular the theory of computational complexity and database theory. One of the fundamental insights of mathematical logic is that our unders