Definability in substructure orderings. IV: Finite lattices
From MaRDI portal
(Redirected from Definability in substructure orderings. IV: Finite lattices)
Recommendations
- Definability in substructure orderings. III: Finite distributive lattices
- Definability in substructure orderings. II: Finite ordered sets
- scientific article; zbMATH DE number 3977073
- Definability in substructure orderings. I: Finite semilattices
- Definability in the substructure ordering of simple graphs
Cites work
Cited in
(16)- Definability in substructure orderings. I: Finite semilattices
- Definability in substructure orderings. III: Finite distributive lattices
- Lattice of definability in the order of rational numbers
- 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
- Well-Quasi Orders and Hierarchy Theory
- scientific article; zbMATH DE number 1533642 (Why is no real title available?)
- Defining recursive predicates in graph orders
- scientific article; zbMATH DE number 4195916 (Why is no real title available?)
- Definability of recursive predicates in the induced subgraph order
- Definability in first order theories of graph orderings
- Definability in the Homomorphic Quasiorder of Finite Labeled Forests
- 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. IV: Finite lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1047100)