Inherently nonfinitely based lattices

Annals of Pure and Applied Logic 115 (1-3):175-193 (2002)
  Copy   BIBTEX

Abstract

We give a general method for constructing lattices L whose equational theories are inherently nonfinitely based. This means that the equational class generated by L is locally finite and that L belongs to no locally finite finitely axiomatizable equational class. We also provide an example of a lattice which fails to be inherently nonfinitely based but whose equational theory is not finitely axiomatizable

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,475

External links

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

Through your library

Similar books and articles

Infinite substructure lattices of models of Peano Arithmetic.James H. Schmerl - 2010 - Journal of Symbolic Logic 75 (4):1366-1382.
On the representation of n4-lattices.Sergei P. Odintsov - 2004 - Studia Logica 76 (3):385 - 405.
The theory of {vec Z}C(2)^2-lattices is decidable.Stefano Baratella & Carlo Toffalori - 1998 - Archive for Mathematical Logic 37 (2):91-104.

Analytics

Added to PP
2014-01-16

Downloads
12 (#1,075,977)

6 months
8 (#350,876)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Identities in Two-Valued Calculi.R. C. Lyndon - 1953 - Journal of Symbolic Logic 18 (1):69-70.

Add more references