Definability in substructure orderings. IV: Finite lattices
From MaRDI portal
Publication:1047100
DOI10.1007/s00012-009-0019-xzbMath1227.08006OpenAlexW4243337966MaRDI QIDQ1047100
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-0019-x
Lattices of varieties (08B15) Structure theory of lattices (06B05) Interpolation, preservation, definability (03C40)
Related Items (9)
Definability in First Order Theories of Graph Orderings ⋮ Unnamed Item ⋮ Definability in the substructure ordering of finite directed graphs ⋮ 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
This page was built for publication: Definability in substructure orderings. IV: Finite lattices
