Definability in substructure orderings. II: Finite ordered sets

DOI10.1007/S11083-010-9141-9MaRDI QIDQ981680zbMATH OpenOpenAlexFDO

Authors Ralph McKenzie, Jaroslav Ježek

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

first-order definabilitycategorydual posetisomorphism types of finite ordered setslattice of universal classes of posets

Mathematics Subject Classification ID

Partial orders, general (06A06) Equational classes, universal algebra in model theory (03C05) Lattices of varieties (08B15) Interpolation, preservation, definability (03C40)

Recommendations

• Definability in substructure orderings. III: Finite distributive lattices
• Definability in substructure orderings. IV: Finite lattices
• Definability in substructure orderings. I: Finite semilattices
• Definability in the substructure ordering of simple graphs
• scientific article; zbMATH DE number 1404381
• scientific article; zbMATH DE number 3877157
• scientific article; zbMATH DE number 5228045
• Labeled posets are universal
• Lattices of equivalence relations closed under the operations of relation algebras
• Universality results for well-founded posets

Cites work

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

Cited in

(21)

• Definable Sets in Ordered Structures. II
• Definability in the substructure ordering of simple graphs
• scientific article; zbMATH DE number 1301927 (Why is no real title available?)
• scientific article; zbMATH DE number 4195916 (Why is no real title available?)
• Definability in substructure orderings. I: Finite semilattices
• Definability in substructure orderings. IV: Finite lattices
• Definability in substructure orderings. III: Finite distributive lattices
• Axiomatizing the subsumption and subword preorders on finite and infinite partial words
• Prime orders all of whose prime suborders are selfdual
• Defining recursive predicates in graph orders
• Definability in first order theories of graph orderings
• Definability of recursive predicates in the induced subgraph order
• On the automorphism group of the substructure ordering of finite directed graphs
• Definability in the embeddability ordering of finite directed graphs
• Definability in the embeddability ordering of finite directed graphs. II
• Definability in the Subword Order
• Definability in the substructure ordering of finite directed graphs
• Complexity in Young's lattice
• Definable sets in boolean ordered o-minimal structures. II
• Well-Quasi Orders and Hierarchy Theory
• Definable Sets in Ordered Structures. III

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q981680)