Which Two-sorted Algebras of Booleans and Naturals have a Finite Basis?

W.J. Fokkink; J.C. van de Pol; S. Vijay

doi:10.1007/s00012-004-1892-y

Which Two-sorted Algebras of Booleans and Naturals have a Finite Basis?

W.J. Fokkink, J.C. van de Pol, S. Vijay

Research output: Contribution to Journal › Article › Academic › peer-review

Abstract

We show that the two-sorted algebra of Booleans and naturals with conjunction, addition and inequality is not finitely based. If addition is removed, or negation is included, then the resulting algebra is finitely based. © Birkhäuser Verlag, Basel, 2004.

Original language	English
Pages (from-to)	469-485
Journal	Algebra Universalis
Volume	52
Issue number	4
DOIs	https://doi.org/10.1007/s00012-004-1892-y
Publication status	Published - 2005

Bibliographical note

FokkinkPolVijay2005

Access to Document

10.1007/s00012-004-1892-y

Cite this

@article{6bfa4c892bec4d718fd531562b1616db,

title = "Which Two-sorted Algebras of Booleans and Naturals have a Finite Basis?",

abstract = "We show that the two-sorted algebra of Booleans and naturals with conjunction, addition and inequality is not finitely based. If addition is removed, or negation is included, then the resulting algebra is finitely based. {\textcopyright} Birkh{\"a}user Verlag, Basel, 2004.",

author = "W.J. Fokkink and {van de Pol}, J.C. and S. Vijay",

note = "FokkinkPolVijay2005 ",

year = "2005",

doi = "10.1007/s00012-004-1892-y",

language = "English",

volume = "52",

pages = "469--485",

journal = "Algebra Universalis",

issn = "0002-5240",