Relation Algebras by Games

Nonfiction, Science & Nature, Mathematics, Logic, Algebra
Cover of the book Relation Algebras by Games by Robin Hirsch, Ian Hodkinson, Elsevier Science
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: Robin Hirsch, Ian Hodkinson ISBN: 9780080540450
Publisher: Elsevier Science Publication: August 15, 2002
Imprint: North Holland Language: English
Author: Robin Hirsch, Ian Hodkinson
ISBN: 9780080540450
Publisher: Elsevier Science
Publication: August 15, 2002
Imprint: North Holland
Language: English

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.

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

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.

More books from Elsevier Science

Cover of the book The Structure and Interpretation of the Standard Model by Robin Hirsch, Ian Hodkinson
Cover of the book Understanding AC Circuits by Robin Hirsch, Ian Hodkinson
Cover of the book Scientific Foundations of Biochemistry in Clinical Practice by Robin Hirsch, Ian Hodkinson
Cover of the book Profiles of Drug Substances, Excipients and Related Methodology by Robin Hirsch, Ian Hodkinson
Cover of the book Social Networks in China by Robin Hirsch, Ian Hodkinson
Cover of the book Single Molecule Biology by Robin Hirsch, Ian Hodkinson
Cover of the book Advances in Pharmacology by Robin Hirsch, Ian Hodkinson
Cover of the book Beyond Compliance by Robin Hirsch, Ian Hodkinson
Cover of the book Psychoneuroimmunology by Robin Hirsch, Ian Hodkinson
Cover of the book Handbook of Plastics Joining by Robin Hirsch, Ian Hodkinson
Cover of the book Personal Safety and Security Playbook by Robin Hirsch, Ian Hodkinson
Cover of the book Nuclear Nonproliferation by Robin Hirsch, Ian Hodkinson
Cover of the book Philosophy of Statistics by Robin Hirsch, Ian Hodkinson
Cover of the book Pervasive Information Architecture by Robin Hirsch, Ian Hodkinson
Cover of the book Construction Hazardous Materials Compliance Guide by Robin Hirsch, Ian Hodkinson
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy