Relation Algebras by Games, Volume 147

Copertina anteriore
Gulf Professional Publishing, 15 ago 2002 - 691 pagine
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.

 

Sommario

Introduction
1
Algebras of Relations
23
Preliminaries
25
Binary relations and relation algebra
99
Examples of relation algebras
133
Relativisation and cylindric algebras
151
Other approaches to algebras of relations
199
Games
213
Relational cylindric and hyperbases
363
Approximations to RRA
399
Constructing Relation Algebras
439
Strongly representable relation algebra atom structures
445
Nonfinite axiomatisability of SRaCAn+1 over SRaCAn
463
The rainbow construction for relation algebras
491
Applying the rainbow construction
513
Decidability
537

Games and networks
217
Axiomatising representable relation algebras and cylindric algebras
261
Axiomatising pseudoelementary classes
273
Game trees
309
Atomic networks
335
Approximations
353
Undecidability of the representation problem for finite algebras
539
Finite base property
581
Epilogue
607
Brief summary
609
Problems
625
Copyright

Altre edizioni - Visualizza tutto

Parole e frasi comuni

Brani popolari

Pagina 653 - Kolaitis, editors, Descriptive complexity and finite models, volume 31 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 149-184.
Pagina 634 - Burris and HP Sankappanavar. A course in universal algebra. Volume 78 of Graduate Texts in Mathematics, Springer- Verlag, 1981.
Pagina 641 - I. Hodkinson, F. Wolter, and M. Zakharyaschev. Decidable and undecidable fragments of first-order branching temporal logics. In Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (LICS 2002), pages 393-402.
Pagina 649 - In Proceedings of the 12th National Conference of the American Association for Artificial Intelligence, pages 356-361, Seattle, WA, July 1994.

Informazioni bibliografiche