Undecidability of free pseudo-complemented semilattices

DOI10.2977/PRIMS/1195176449zbMath0637.03009OpenAlexW2074272772MaRDI QIDQ1098833

Paweł M. Idziak

Publication date: 1987

Published in: Publications of the Research Institute for Mathematical Sciences, Kyoto University (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2977/prims/1195176449

zbMATH Keywords

finitely generated free pseudo-complemented semilattices

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Decidability of theories and sets of sentences (03B25) Equational logic, Mal'tsev conditions (08B05) Free algebras (08B20) Semilattices (06A12)

Related Items (2)

The decision problem for finite algebras from arithmetical varieties with equationally definable principal congruences ⋮ Reduced sub-powers and the decision problem for finite algebras in arithmetical varieties

Cites Work

• Lattice-theoretic decision problems in universal algebra
• Stone lattices
• Undecidable theories
• Decidability and Boolean representations
• On free pseudo-complemented and relatively pseudo-complemented semi-lattices
• On direct products of theories
• Concatenation as a basis for arithmetic

This page was built for publication: Undecidability of free pseudo-complemented semilattices