Cargando…
Fork algebras in algebra : logic and computer science /
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...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
River Edge, NJ :
World Scientific,
2002.
|
| Colección: | Advances in logic ;
v. 2. |
| Temas: | |
| Acceso en línea: | Texto completo |
Tabla de Contenidos:
- Ch. 1. Introduction and motivations. 1.1. Software specification, binary relations and fork
- ch. 2. Algebras of binary relations and relation algebras. 2.1. History and definitions. 2.2. Arithmetical properties
- ch. 3. Proper and abstract fork algebras. 3.1. On the origin of fork algebras. 3.2. Definition of the classes. 3.3. Arithmetical properties
- ch. 4. Representability and independence. 4.1. Representability of abstract fork algebras. 4.2. Independence of the axiomatization of fork
- ch. 5. Interpretability of classical first-order logic. 5.1. Basic definitions. 5.2. Interpreting FOLE
- ch. 6. Algebraization of non-classical logics. 6.1. Basic definitions and properties. 6.2. The fork logic FL. 6.3. Modal logics. 6.4. Representation of constraints in FL. 6.5. Interpretability of modal logics in FL. 6.6. A proof theoretical approach. 6.7. Interpretability of propositional dynamic logic in FL. 6.8. The fork logic FL'. 6.9. A Rasiowa-Sikorski calculus for FL'. 6.10. A relational proof system for intuitionistic logic. 6.11. A relational proof system for minimal intuitionistic logic. 6.12. Relational reasoning in intermediate logics
- ch. 7. A calculus for program construction. 7.1. Introduction. 7.2. Filters and sets. 7.3. The relational implication. 7.4. Representability and expressiveness in program construction. 7.5. A methodology for program construction. 7.6. Examples. 7.7. A D & C algorithm for MAXSTA. 7.8. Comparison with previous work.