Complexity in Young's lattice
From MaRDI portal
Publication:2668002
Recommendations
Cites work
- A Gandy theorem for abstract structures and applications to first-order definability
- Definability in lattices of equational theoris
- Definability in substructure orderings. I: Finite semilattices
- Definability in substructure orderings. II: Finite ordered sets
- Definability in substructure orderings. III: Finite distributive lattices
- Definability in the embeddability ordering of finite directed graphs. II
- Definability in the Infix Order on Words
- Definability in the lattice of equational theories of semigroups
- Definability in the substructure ordering of simple graphs
- Definability in the Subword Order
- Defining recursive predicates in graph orders
- Differential Posets
- scientific article; zbMATH DE number 3751028 (Why is no real title available?)
- scientific article; zbMATH DE number 545277 (Why is no real title available?)
- scientific article; zbMATH DE number 7297889 (Why is no real title available?)
- scientific article; zbMATH DE number 3245465 (Why is no real title available?)
- Mathematical Logic
- Reconstruction of partitions
- The falsity of the reconstruction conjecture for tournaments
- Theories of orders on the set of words
- Undecidable theories
- Young's lattice and dihedral symmetries
Cited in
(3)
This page was built for publication: Complexity in Young's lattice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2668002)