Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-16T09:38:56.726Z Has data issue: false hasContentIssue false

Undecidability of representability as binary relations

Published online by Cambridge University Press:  12 March 2014

Robin Hirsch
Affiliation:
Department of Computer Science, University College London, London WC1E 6BT, UK, E-mail: R.Hirsch@cs.ucl.ac.uk
Marcel Jackson
Affiliation:
Department of Mathematics and Statistics, La Trobe University, Victoria 3086, Australia, E-mail: M.G.Jackson@latrobe.edu.au

Abstract

In this article we establish the undecidability of representability and of finite representability as algebras of binary relations in a wide range of signatures. In particular, representability and finite representability are undecidable for Boolean monoids and lattice ordered monoids, while representability is undecidable for Jónsson's relation algebra. We also establish a number of undecidability results for representability as algebras of injective functions.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2012

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable