Decidability of lattice equations

DOI10.1007/S11225-023-10063-4MaRDI QIDQ6562367zbMATH OpenFDO

Authors Nikolaos Galatos

Publication date 26 June 2024

Published in Studia Logica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11225-023-10063-4

zbMATH Keywords

decidabilityequational theorylatticeresiduated frame

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Cites work

• A Simple Solution to the Word Problem for Lattices
• Free lattices
• scientific article; zbMATH DE number 1748069 (Why is no real title available?)
• Logisch-kombinatorische Untersuchungen über die Erfüllbarkeit oder Beweisbarkeit mathematischer Sätze nebst einem Theoreme über dichte Mengen.
• Permutability of rules in lattice theory.
• Residuated frames with applications to decidability
• Residuated lattices. An algebraic glimpse at substructural logics

Cited in

(2)

• On the uniform word problem for lattices
• On the theory of subalgebra lattices for arbitrary groupoids

This page was built for publication: Decidability of lattice equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6562367)