Complexity in Young's lattice

DOI10.1016/J.APAL.2021.103075OpenAlexW4206369274MaRDI QIDQ2668002FDOQ2668002

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

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

Cites Work

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

Cited In (2)

• Complexity in Young's Lattice
• Title not available (Why is that?)

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)