Pages that link to "Item:Q981680"

The following pages link to Definability in substructure orderings. II: Finite ordered sets (Q981680):

Displaying 21 items.

• Definability in the substructure ordering of simple graphs (Q259729) (← links)
• Prime orders all of whose prime suborders are selfdual (Q603888) (← links)
• Definability in substructure orderings. I: Finite semilattices (Q1040653) (← links)
• Definability in substructure orderings. IV: Finite lattices (Q1047100) (← links)
• Definability in substructure orderings. III: Finite distributive lattices (Q1047103) (← links)
• Axiomatizing the subsumption and subword preorders on finite and infinite partial words (Q1605337) (← links)
• Definability in the embeddability ordering of finite directed graphs (Q2264119) (← links)
• Definability in the embeddability ordering of finite directed graphs. II (Q2314424) (← links)
• Definability in the substructure ordering of finite directed graphs (Q2665828) (← links)
• Complexity in Young's lattice (Q2668002) (← links)
• Well-Quasi Orders and Hierarchy Theory (Q3295154) (← links)
• Definable Sets in Ordered Structures. III (Q3487323) (← links)
• Definability in the Subword Order (Q3576212) (← links)
• Definable Sets in Ordered Structures. II (Q3812218) (← links)
• (Q4247158) (← links)
• Definable sets in boolean ordered o-minimal structures. II (Q4457725) (← links)
• (Q4683860) (← links)
• (Q5202641) (← links)
• Definability of Recursive Predicates in the Induced Subgraph Order (Q5224502) (← links)
• Definability in First Order Theories of Graph Orderings (Q5283438) (← links)
• On the automorphism group of the substructure ordering of finite directed graphs (Q6615246) (← links)