Every Free Biresiduated Lattice is Semisimple

Reports on Mathematical Logic:125-133 (2003)
  Copy   BIBTEX

Abstract

In this paper, we prove the semisimplicity of free biresiduated lattices, more precisely, integral residuated lattices. In [4], authors show that variety of residuated lattices, more precisely, commutative integral residuated lattices, is generated by its finite simple members. The result is obtained by showing that every {\it free} residuated lattice is semisimple and then showing that every variety generated by a simple residuated lattice is generated by a set of finite simple residuated lattices. The proof of the former is based on Gri\v{s}in's idea in [2]. We show that their proof of the semisimplicity works well also for free biresiduated lattices.

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 104,804

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2015-02-12

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references