Definability in substructure orderings. IV: Finite lattices
From MaRDI portal
Publication:1047100
DOI10.1007/s00012-009-0019-xzbMath1227.08006MaRDI 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
08B15: Lattices of varieties
06B05: Structure theory of lattices
03C40: Interpolation, preservation, definability
Related Items
Unnamed Item, Definability of Recursive Predicates in the Induced Subgraph Order, Definability in First Order Theories of Graph Orderings, Definability in the substructure ordering of simple graphs, Definability in substructure orderings. II: Finite ordered sets, Definability in the embeddability ordering of finite directed graphs, Definability in the embeddability ordering of finite directed graphs. II, Definability in the substructure ordering of finite directed graphs, Well-Quasi Orders and Hierarchy Theory
Cites Work