Definability in substructure orderings. III: Finite distributive lattices

DOI10.1007/s00012-009-0021-3zbMath1227.08007OpenAlexW1984149666MaRDI QIDQ1047103

Ralph McKenzie, Jaroslav Jezek

Publication date: 4 January 2010

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

Full work available at URL: https://doi.org/10.1007/s00012-009-0021-3

zbMATH Keywords

first-order definabilityfinite distributive latticeslattice of universal classes

Mathematics Subject Classification ID

Lattices of varieties (08B15) Structure and representation theory of distributive lattices (06D05) Axiomatic model classes (08C10) Interpolation, preservation, definability (03C40)

Related Items (10)

Definability in First Order Theories of Graph Orderings ⋮ Unnamed Item ⋮ Definability in the substructure ordering of finite directed graphs ⋮ Complexity in Young's lattice ⋮ Well-Quasi Orders and Hierarchy Theory ⋮ Definability in the embeddability ordering of finite directed graphs ⋮ Definability in substructure orderings. II: Finite ordered sets ⋮ 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

• Lattices with large minimal extensions
• Unnamed Item

This page was built for publication: Definability in substructure orderings. III: Finite distributive lattices