Fork Algebras in Algebra, Logic and Computer Science

Hardcover (Print)
Buy New
Buy New from
Used and New from Other Sellers
Used and New from Other Sellers
from $68.36
Usually ships in 1-2 business days
(Save 21%)
Other sellers (Hardcover)
  • All (5) from $68.36   
  • New (4) from $68.36   
  • Used (1) from $86.99   


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 are foreseen, and the book covers all the essentials in order to provide the reader with a better understanding.
Read More Show Less

Product Details

  • ISBN-13: 9789810248765
  • Publisher: World Scientific Publishing Company, Incorporated
  • Publication date: 7/28/2002
  • Series: Advances in Logic Series
  • Pages: 232
  • Product dimensions: 6.30 (w) x 9.10 (h) x 0.80 (d)

Table of Contents

Ch. 1 Introduction and Motivations 1
1.1 Software Specification, Binary Relations and Fork 1
Ch. 2 Algebras of Binary Relations and Relation Algebras 5
2.1 History and Definitions 5
2.2 Arithmetical Properties 12
Ch. 3 Proper and Abstract Fork Algebras 19
3.1 On the Origin of Fork Algebras 19
3.2 Definition of the Classes 21
3.3 Arithmetical Properties 26
Ch. 4 Representability and Independence 37
4.1 Representability of Abstract Fork Algebras 38
4.2 Independence of the Axiomatization of Fork 43
Ch. 5 Interpretability of Classical First-Order Logic 49
5.1 Basic Definitions 49
5.2 Interpreting FOLE 51
Ch. 6 Algebraization of Non-Classical Logics 73
6.1 Basic Definitions and Properties 75
6.2 The Fork Logic FL 76
6.3 Modal Logics 78
6.4 Representation of Constraints in FL 80
6.5 Interpretability of Modal Logics in FL 81
6.6 A Proof Theoretical Approach 86
6.7 Interpretability of Propositional Dynamic Logic in FL 91
6.8 The Fork Logic FL' 102
6.9 A Rasiowa-Sikorski Calculus for FL' 104
6.10 A Relational Proof System for Intuitionistic Logic 115
6.11 A Relational Proof System for Minimal Intuitionistic Logic 126
6.12 Relational Reasoning in Intermediate Logics 132
Ch. 7 A Calculus for Program Construction 139
7.1 Introduction 139
7.2 Filters and Sets 141
7.3 The Relational Implication 143
7.4 Representability and Expressiveness in Program Construction 149
7.5 A Methodology for Program Construction 150
7.6 Examples 158
7.7 A D&C Algorithm for MAXSTA 192
7.8 Comparison with Previous Work 203
Bibliography 207
Index 215
Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star


4 Star


3 Star


2 Star


1 Star


Your Rating:

Your Name: Create a Pen Name or

Barnes & Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation


  • - By submitting a review, you grant to Barnes & and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Terms of Use.
  • - Barnes & reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously
Sort by: Showing 1 Customer Reviews
  • Anonymous

    Posted November 20, 2002


    Errores de ortografia. Incoherencias y falta de informacion. No lo recomiendo

    Was this review helpful? Yes  No   Report this review
Sort by: Showing 1 Customer Reviews

If you find inappropriate content, please report it to Barnes & Noble
Why is this product inappropriate?
Comments (optional)