Definability in substructure orderings. I: Finite semilattices

DOI10.1007/s00012-009-0002-6zbMath1181.08004OpenAlexW2106009495MaRDI QIDQ1040653

Ralph McKenzie, Jaroslav Jezek

Publication date: 25 November 2009

Published in: Algebra Universalis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00012-009-0002-6

zbMATH Keywords

finite semilatticesfinitely axiomatizable universal classesfinitely generated universal classeslattice of universal classespositive definability

Mathematics Subject Classification ID

Lattices of varieties (08B15) Equational classes, universal algebra in model theory (03C05) Semilattices (06A12) Axiomatic model classes (08C10) Interpolation, preservation, definability (03C40)

Related Items (14)

Definability in First Order Theories of Graph Orderings ⋮ The Subtrace Order and Counting First-Order Logic ⋮ Unnamed Item ⋮ Definability in the substructure ordering of finite directed graphs ⋮ Complexity in Young's lattice ⋮ Alternating complexity of counting first-order logic for the subword order ⋮ Well-Quasi Orders and Hierarchy Theory ⋮ Definability in the embeddability ordering of finite directed graphs ⋮ Definability in substructure orderings. II: Finite ordered sets ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Definability of Recursive Predicates in the Induced Subgraph Order ⋮ Definability in the embeddability ordering of finite directed graphs. II ⋮ Definability in the substructure ordering of simple graphs

Cites Work

• Unnamed Item
• Definability in the lattice of equational theories of semigroups
• The ordering of commutative terms
• Definability in the lattice of equational theories of commutative semigroups

This page was built for publication: Definability in substructure orderings. I: Finite semilattices