Cut elimination and word problems for varieties of lattices (Q786808)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3838013
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cut elimination and word problems for varieties of lattices |
scientific article; zbMATH DE number 3838013 |
Statements
Cut elimination and word problems for varieties of lattices (English)
0 references
1981
0 references
decidability
0 references
variety of lattices
0 references
0.7845079898834229
0 references
0.772057831287384
0 references
0.7513665556907654
0 references
The author starts from the connection between the equational properties for a variety of lattices and the cut elimination rule in the corresponding logical calculus describing this variety. In the first part a calculus \(L\) for lattices as algebras with two binary operations \((\wedge, \vee)\) and with an unspecified number of constants is defined. Next, a calculus for lattices as (partially) ordered sets is considered. In order to show that the validity of the cut-rule does not depend on the equational class of algebras but on the presentation of the corresponding logical calculus, the author uses the class of grids \(\langle E, \vee, \wedge)\) (i.e. with absorption and commutativity only). Also, the relationship between cut elimination and the distributivity of a lattice is considered. In the second part of the paper the author gives some results about the word problem for the classes of (almost-) ortho- and pseudo-complemented lattices. For the classes above, the general word problem is solvable (as is shown in the third part). Finally, a conjecture about the class of orthomodular lattices is formulated.
0 references