Undecidability of free pseudo-complemented semilattices

DOI10.2977/PRIMS/1195176449zbMATH Open0637.03009OpenAlexW2074272772MaRDI QIDQ1098833FDOQ1098833

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

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

Cites Work

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

Cited In (4)

• 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
• Decidability, undecidability, and PSPACE-completeness of the twins property in the tropical semiring
• Title not available (Why is that?)

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

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