Implication algebras and implication semigroups of binary relations
From MaRDI portal
(Redirected from Publication:6174423)
Abstract: Representable implication algebras are known to be axiomatised by a finite number of equations (making the representation and finite representation problems decidable here). We show that this also holds in the context of unary (and binary) relations and present a Stone-style representation theorem. We then show that the (finite) representation decision problem is undecidable for implication semigroups, in stark contrast with implication algebras.
Recommendations
- Iimplication algebras
- scientific article; zbMATH DE number 3271476
- Relation algebras, idempotent semirings and generalized bunched implication algebras
- Generalizations of Implication Algebras
- scientific article; zbMATH DE number 908155
- Implication BL-algebras
- N-semisimple algebra and implication algebra.
- Implicational classes of De Morgan Boolean algebras
- On implicative semigroups
- scientific article; zbMATH DE number 800074
Cites work
- An algebraic approach to non-classical logics
- Embeddability and the Word Problem
- scientific article; zbMATH DE number 193143 (Why is no real title available?)
- Relation algebras as residuated Boolean algebras
- Relation algebras by games
- The structure of generalized BI-algebras and weakening relation algebras
- Undecidability of Algebras of Binary Relations
- Undecidability of representability as binary relations
- Undecidability of representability for lattice-ordered semigroups and ordered complemented semigroups
- Weakening Relation Algebras and FL^2-algebras
Cited in
(4)
This page was built for publication: Implication algebras and implication semigroups of binary relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6174423)