No label defined (Q3146903)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1801371
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1801371 |
Statements
17 September 2002
0 references
fork algebras
0 references
relational algebras
0 references
representable algebras
0 references
algebraic logic
0 references
algebraization of logics
0 references
program construction
0 references
specification and verification
0 references
0.9106901
0 references
0.9044033
0 references
0.8983737
0 references
0.8931163
0 references
This is a monograph on the theory and applications of fork algebras. A fork algebra is a relational algebra enriched with an additional binary function \(*\) in the domain of the relations, and an additional binary operation on relations, called fork, defined as follows: \[ S \underline{\nabla} T :=\{\langle x,y\ast z\rangle \mid xSy\wedge xTz\}. \] The book begins with a short introductory chapter providing motivations for the study of fork algebras as a framework for program specification, verification and derivation. Chapter 2 is preliminary and briefly introduces relational algebras. Chapter 3 introduces fork algebras in two ways: set-theoretically and as equationally defined (finitely based) abstract structures, and derives some arithmetic properties of them. In Chapter 4 representation results are estabslished for fork algebras, as well as independence of their set of defining axioms. Chapter 5 provides an interpretation of first-order classical logic into the equational calculus of fork algebras. Chapter 6 demonstrates how modal, dynamic, intuitionistic, and other nonclassical logics can be interpreted into Fork Logic and can be provided with algebraic semantics based on fork algebras. Chapter 7 presents a calculus for program construction based on the first-order theory of fork algebras, which is the original motivation for the development of the latter. The book is well organized and written, although at places it dwells upon long and detailed calculations some of which could have been left to the reader. It is a valuable contribution to the field of relational methods in computer science and should be of interest for students and researchers both in algebraic logic and computer science.
0 references