System Upgrade on Tue, May 28th, 2024 at 2am (EDT)
Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.
Fork algebras are a formalism based on the relational calculus, with interesting algebraic and metalogical properties. Their representability is especially appealing in computer science, since it allows a closer relationship between their language and models. This book gives a careful account of the results and presents some applications of Fork algebras in computer science, particularly in system specification and program construction. Many applications of Fork algebras in formal methods can be applied in many ways, and the book covers all the essentials in order to provide the reader with a better understanding.
Sample Chapter(s)
Chapter 1: Introduction and Motivations (110 KB)
Contents:
- Introduction and Motivations
- Algebras of Binary Relations and Relation Algebras
- Proper and Abstract Fork Algebras
- Representability and Independence
- Interpretability of Classical First-Order Logic
- Algebraization of Non-Classical Logics
- A Calculus for Program Construction
Readership: Graduate students and researchers using relational methods in computer science.
