by Marcelo Fabián Frias (University of Buenos Aires, Argentina)

Table of Contents (55k)
Preface (69k)
Chapter 1: Introduction and Motivations (110k)

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.

• 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