Definability in substructure orderings. II: Finite ordered sets

DOI10.1007/s11083-010-9141-9zbMath1209.08003OpenAlexW1992111324MaRDI QIDQ981680

Ralph McKenzie, Jaroslav Jezek

Publication date: 2 July 2010

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11083-010-9141-9

zbMATH Keywords

categoryfirst-order definabilitydual posetisomorphism types of finite ordered setslattice of universal classes of posets

Mathematics Subject Classification ID

Partial orders, general (06A06) Lattices of varieties (08B15) Equational classes, universal algebra in model theory (03C05) 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 ⋮ Complexity in Young's lattice ⋮ Well-Quasi Orders and Hierarchy Theory ⋮ Definability in the embeddability ordering of finite directed graphs ⋮ 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

• Definability in substructure orderings. I: Finite semilattices
• Avoidable structures. I: Finite ordered sets, semilattices and lattices
• Avoidable structures. II: Finite distributive lattices and nicely structured ordered sets
• Definability in substructure orderings. IV: Finite lattices
• Definability in substructure orderings. III: Finite distributive lattices
• What is reconstruction for ordered sets?

This page was built for publication: Definability in substructure orderings. II: Finite ordered sets