**Memoirs of the American Mathematical Society**

1997;
126 pp;
Softcover

MSC: Primary 03;
Secondary 08

Print ISBN: 978-0-8218-0595-4

Product Code: MEMO/126/604

List Price: $48.00

Individual Member Price: $28.80

**Electronic ISBN: 978-1-4704-0189-4
Product Code: MEMO/126/604.E**

List Price: $48.00

Individual Member Price: $28.80

# Decision Problems for Equational Theories of Relation Algebras

Share this page
*Hajnal Andréka; Steven Givant; István Németi*

This work presents a systematic study of decision problems for equational theories of algebras of binary relations (relation algebras). For example, an easily applicable but deep method, based on von Neumann's coordinatization theorem, is developed for establishing undecidability results. The method is used to solve several outstanding problems posed by Tarski. In addition, the complexity of intervals of equational theories of relation algebras with respect to questions of decidability is investigated. Using ideas that go back to Jónsson and Lyndon, the authors show that such intervals can have the same complexity as the lattice of subsets of the set of the natural numbers. Finally, some new and quite interesting examples of decidable equational theories are given.

The methods developed in the monograph show promise of broad applicability. They provide researchers in algebra and logic with a new arsenal of techniques for resolving decision questions in various domains of algebraic logic.

#### Table of Contents

# Table of Contents

## Decision Problems for Equational Theories of Relation Algebras

- Contents vii8 free
- Introduction xi12 free
- Chapter I. Preliminaries 116 free
- Chapter II. Undecidability 1328
- Chapter III. A lattice embedding that preserves decidability and undecidability 5570
- Chapter IV. A finitely generated, infinite, simple relation algebra with a decidable equational theory 6782
- Bibliography 112127
- Index of symbols 115130 free
- Index of names and subjects 119134 free

#### Readership

Graduate students, research mathematicians and computer scientists interested in questions of computability in algebra, logic and computer science.