Complexity in Young's lattice

DOI10.1016/j.apal.2021.103075OpenAlexW4206369274MaRDI QIDQ2668002

Alexander Wires

Publication date: 3 March 2022

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.13360

zbMATH Keywords

partitionscomplexitydefinabilityYoung's lattice

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Combinatorics of partially ordered sets (06A07) Undecidability and degrees of sets of sentences (03D35) Models with special properties (saturated, rigid, etc.) (03C50) Model theory of denumerable and separable structures (03C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Definability in the substructure ordering of simple graphs
• Definability in substructure orderings. II: Finite ordered sets
• Definability in substructure orderings. I: Finite semilattices
• Definability in substructure orderings. III: Finite distributive lattices
• Definability in the lattice of equational theories of semigroups
• Young's lattice and dihedral symmetries
• Definability in the embeddability ordering of finite directed graphs. II
• Reconstruction of partitions
• Undecidable theories
• Theories of orders on the set of words
• A Gandy Theorem for Abstract Structures and Applications to First-Order Definability
• Definability in the Subword Order
• Definability in the Infix Order on Words
• Differential Posets
• Definability in lattices of equational theoris
• The falsity of the reconstruction conjecture for tournaments
• Mathematical Logic

This page was built for publication: Complexity in Young's lattice