The class of prime semilattices is not finitely axiomatizable

DOI10.1007/PL00005908zbMATH Open0905.06004OpenAlexW1991614578MaRDI QIDQ1362896FDOQ1362896

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

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
• Publication:4484695

zbMATH Keywords

prime filterfinite axiomatizabilitymeet-semilatticeprime semilattices

Mathematics Subject Classification ID

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

Cited In (8)

• CLOSURE OPERATORS, FRAMES AND NEATEST REPRESENTATIONS
• Characterizations for Prime Semilattices
• Title not available (Why is that?)
• RECURSIVE AXIOMATISATIONS FROM SEPARATION PROPERTIES
• Non-elementary classes of representable posets
• 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)