Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

41

APAL
2002

favoriteEmaildiscussreport

83views more APAL 2002»

Inherently nonfinitely based lattices

13 years 10 months ago

Inherently nonfinitely based lattices

Download www.math.sc.edu

We give a general method for constructing lattices L whose equational theories are inherently nonfinitely based. This means that the equational class (that is, the variety) 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. Key words: lattice, finite axiomatizability, inherently nonfinitely based

Ralph Freese, George F. McNulty, James B. Nation

Real-time Traffic

APAL 2002 | Equational | Equational Class | Equational Theories |

claim paper

Related Content

» Learning Context Free Grammars with the Syntactic Concept Lattice

» Dirtypaper trellis codes for watermarking

» Smooth Projective Hashing and PasswordBased Authenticated Key Exchange from Lattices

» On The Limitations of The Naive Lattice Decoding

» Design of Class Hierarchies Based on Concept Galois Lattices

» Temporal Integration of Multiple SilhouetteBased BodyPart Hypotheses

» Complex Lattice Reduction Algorithm for LowComplexity MIMO Detection

» AlphaSum sizeconstrained table summarization using value lattices

» CPSPtools Exact and complete algorithms for highthroughput 3D lattice protein studies

Post Info
More Details (n/a)

Added	16 Dec 2010
Updated	16 Dec 2010
Type	Journal
Year	2002
Where	APAL
Authors	Ralph Freese, George F. McNulty, James B. Nation

Comments (0)