Cut elimination and word problems for varieties of lattices

DOI10.1007/BF02483891zbMath0528.03029OpenAlexW2055247079MaRDI QIDQ786808

Juergen Schulte Moenting

Publication date: 1981

Published in: Algebra Universalis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02483891

zbMATH Keywords

decidabilityvariety of lattices

Mathematics Subject Classification ID

Logical aspects of lattices and related structures (03G10) Cut-elimination and normal-form theorems (03F05) Word problems, etc. in computability and recursion theory (03D40)

Related Items (9)

The intensional side of algebraic-topological representation theorems ⋮ Bibliography on quantum logics and related structures ⋮ Lattice logic, bilattice logic and paraconsistent quantum logic: a unified framework based on monosequent systems ⋮ Proof theory of paraconsistent quantum logic ⋮ A solution of the uniform word problem for ortholattices ⋮ Alternative multilattice logics: an approach based on monosequent and indexed monosequent calculi ⋮ 1982 news about orthomodular lattices ⋮ The geometry of non-distributive logics ⋮ Proof theory for linear lattices

Cites Work

• Unnamed Item
• Recursively unsolvable word problems of modular lattices and diagram- chasing
• Untersuchungen über das logische Schliessen. I
• Stone lattices
• Free lattices
• Orthomodular Logic
• Quasideduktive Systeme und S-Algebren
• The Word Problem for Abstract Algebras
• Algebraische und logistische Untersuchungen über freie Verbände
• Embeddability and the Word Problem

This page was built for publication: Cut elimination and word problems for varieties of lattices