The class of prime semilattices is not finitely axiomatizable

DOI10.1007/PL00005908MaRDI QIDQ1362896zbMATH OpenOpenAlexFDO

Authors Keith A. Kearnes

Publication date 7 August 1997

Published in Semigroup Forum (Search for Journal in Brave)

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

zbMATH Keywords

prime filterfinite axiomatizabilitymeet-semilatticeprime semilattices

Mathematics Subject Classification ID

Basic properties of first-order languages and structures (03C07) Semilattices (06A12)

Recommendations

• Characterizations for Prime Semilattices
• A Representation Theory for Prime and Implicative Semilattices
• On complementation of prime semilattices
• The class of algebraically closed p-semilattices is finitely axiomatizable
• scientific article; zbMATH DE number 1452738

Cited in

(8)

• Characterizations for Prime Semilattices
• scientific article; zbMATH DE number 4031016 (Why is no real title available?)
• Closure operators, frames and neatest representations
• Non-elementary classes of representable posets
• Recursive axiomatisations from separation properties
• Prime automata do not exist
• No finite axiomatizations for posets embeddable into distributive lattices
• Recursive axiomatizations for representable posets

This page was built for publication: The class of prime semilattices is not finitely axiomatizable

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