Definability in substructure orderings. III: Finite distributive lattices
From MaRDI portal
(Redirected from Publication:1047103)
Recommendations
- Definability in substructure orderings. IV: Finite lattices
- Definability in substructure orderings. II: Finite ordered sets
- Avoidable structures. II: Finite distributive lattices and nicely structured ordered sets
- Definability in substructure orderings. I: Finite semilattices
- scientific article; zbMATH DE number 4168753
Cites work
Cited in
(16)- Definability in substructure orderings. I: Finite semilattices
- Avoidable structures. II: Finite distributive lattices and nicely structured ordered sets
- Definability in substructure orderings. IV: Finite lattices
- 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 simple graphs
- Definability in the substructure ordering of finite directed graphs
- Complexity in Young's lattice
- scientific article; zbMATH DE number 4174992 (Why is no real title available?)
- Well-Quasi Orders and Hierarchy Theory
- Definable Sets in Ordered Structures. III
- Defining recursive predicates in graph orders
- Definability of recursive predicates in the induced subgraph order
- Definability in first order theories of graph orderings
- On the automorphism group of the substructure ordering of finite directed graphs
- Definability in substructure orderings. II: Finite ordered sets
This page was built for publication: Definability in substructure orderings. III: Finite distributive lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1047103)