Undecidability of the Equational Theory of Some Classes of Residuated Boolean Algebras with Operators

, &
Logic Journal of the IGPL 3 (1):93-105 (1995)
  Copy   BIBTEX

Abstract

We show the undecidability of the equational theories of some classes of BAOs with a non-associative, residuated binary extra-Boolean operator. These results solve problems in Jipsen [9], Pratt [21] and Roorda [22], [23]. This paper complements Andréka-Kurucz-Németi-Sain-Simon [3] where the emphasis is on BAOs with an associative binary operator

Categories

Keywords

Reprint years

DOI

10.1093/jigpal/3.1.93

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,448

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Undecidable Varieties of Semilattice—ordered Semigroups, of Boolean Algebras with Operators, and logics extending Lambek Calculus.A. Kurucz, I. Nemeti, I. Sain & A. Simon - 1993 - Logic Journal of the IGPL 1 (1):91-98.
Weakly associative relation algebras with projections.Agi Kurucz - 2009 - Mathematical Logic Quarterly 55 (2):138-153.
Undecidability of Algebras of Binary Relations.Robin Hirsch, Ian Hodkinson & Marcel Jackson - 2021 - In Judit Madarász & Gergely Székely (eds.), Hajnal Andréka and István Németi on Unity of Science: From Computing to Relativity Theory Through Algebraic Logic. Springer. pp. 267-287.
Infinitary Action Logic: Complexity, Models and Grammars.Wojciech Buszkowski & Ewa Palka - 2008 - Studia Logica 89 (1):1-18.
Weakly associative relation algebras with polyadic composition operations.Vera Stebletsova - 2000 - Studia Logica 66 (2):297-323.
The equational theories of representable residuated semigroups.Szabolcs Mikulás - 2015 - Synthese 192 (7):2151-2158.
Andréka H., Givant S., and Németi I.. Decision problems for equational theories of relation algebras. Memoirs of the American Mathematical Society, vol. 126, no. 604. American Mathematical Society, Providence, March 1997, xiv+ 126 pp. [REVIEW]Roger D. Maddux - 2003 - Bulletin of Symbolic Logic 9 (1):37-39.
Undecidability of representability as binary relations.Robin Hirsch & Marcel Jackson - 2012 - Journal of Symbolic Logic 77 (4):1211-1244.
Semisimplicity, EDPC and Discriminator Varieties of Bounded Weak-commutative Residuated Lattices with an S4-like Modal Operator.Hiroki Takamura - 2012 - Studia Logica 100 (6):1137-1148.
Bounded BCK‐algebras and their generated variety.Joan Gispert & Antoni Torrens - 2007 - Mathematical Logic Quarterly 53 (2):206-213.

Analytics

Added to PP
2015-02-04

Downloads
24 (#897,904)

6 months
6 (#827,406)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Decidable and undecidable logics with a binary modality.ágnes Kurucz, István Németi, Ildikó Sain & András Simon - 1995 - Journal of Logic, Language and Information 4 (3):191-206.

Add more citations

References found in this work

No references found.

Add more references