Relation Algebras by Games

Hardcover (Print)
Used and New from Other Sellers
Used and New from Other Sellers
from $93.51
Usually ships in 1-2 business days
(Save 44%)
Other sellers (Hardcover)
  • All (7) from $93.51   
  • New (6) from $93.51   
  • Used (1) from $177.13   


Relation algebras are algebras arising from the study of binary relations.
They form a part of the field of algebraic logic, and have applications in proof theory, modal logic, and computer science. This research text uses combinatorial games to study the fundamental notion of representations of relation algebras. Games allow an intuitive and appealing approach to the subject, and permit substantial advances to be made. The book contains many new results and proofs not published elsewhere. It should be invaluable to graduate students and researchers interested in relation algebras and games.

After an introduction describing the authors' perspective on the material, the text proper has six parts. The lengthy first part is devoted to background material, including the formal definitions of relation algebras, cylindric algebras, their basic properties, and some connections between them. Examples are given. Part 1 ends with a short survey of other work beyond the scope of the book. In part 2, games are introduced, and used to axiomatise various classes of algebras. Part 3 discusses approximations to representability, using bases, relation algebra reducts, and relativised representations. Part 4 presents some constructions of relation algebras, including Monk algebras and the 'rainbow construction', and uses them to show that various classes of representable algebras are non-finitely axiomatisable or even non-elementary. Part 5 shows that the representability problem for finite relation algebras is undecidable, and then in contrast proves some finite base property results. Part 6 contains a condensed summary of the book, and a list of problems. There are more than 400 exercises.

The book is generally self-contained on relation algebras and on games, and introductory text is scattered throughout. Some familiarity with elementary aspects of first-order logic and set theory is assumed, though many of the definitions are given. Chapter 2 introduces the necessary universal algebra and model theory, and more specific model-theoretic ideas are explained as they arise.

Read More Show Less

Editorial Reviews

From the Publisher
This unique approach to the study of algebraic logic, to a large extent pioneered by the authors, contrasts with the developments based extensively on universal algebra that are found most often in the literature. the book is well written and not only provides a valuable resource to researchers, but is accessible to graduate students and mathematicians in related areas. Extensive intuitive motivation for the techniques and arguments are provided in addition to technical details. Mathematical Reviews This book is a significant advance in the theory of relation algebras. Many of its main results solve difficult and long-standing problems. Its methods, techniques, and constructions are powerful tools for exploring the intricate and varied world of relation algebras. Its many open problems indicate fruitful directions for further research. Logic Journal of the Interest Group in Pure and Applied Logic, Vol. 11, Issue 5, Sept. 2003

"This book is a significant advance in the theory of relation algebras. Many of its main resultssolve difficult an lond-standing problems."
Roger Maddux, (Ames), in: (Zentralblatt für Mathematik, p.4, Vol. 1018, 2004)

"...for Relation Algebras by Games is indeed a source of intellectual delight, treating its topic in a manner befitting its intrinsic charm and beauty."
Maarten Marx, (University of Amsterdam),in: (Studia Logica, Vol. 76, 2004)

Read More Show Less

Product Details

Table of Contents

1 Introduction 1
I Algebras of Relations 23
2 Preliminaries 25
3 Binary relations and relation algebra 99
4 Examples of relation algebras 133
5 Relativisation and cylindric algebras 151
6 Other approaches to algebras of relations 199
II Games 213
7 Games and networks 217
8 Axiomatising representable relation algebras and cylindric algebras 261
9 Axiomatising pseudo-elementary classes 273
10 Game trees 309
11 Atomic networks 335
III Approximations 353
12 Relational, cylindric, and hyperbases 363
13 Approximations to RRA 399
IV Constructing Relation Algebras 439
14 Strongly representable relation algebra atom structures 445
15 Non-finite axiomatisability of SRaCA[subscript n+1] over SRaCA[subscript n] 463
16 The rainbow construction for relation algebras 491
17 Applying the rainbow construction 513
V Decidability 537
18 Undecidability of the representation problem for finite algebras 539
19 Finite base property 581
VI Epilogue 607
20 Brief summary 609
21 Problems 625
Bibliography 629
Symbol index 655
Subject index 667
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

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