FO-Definability of Shrub-Depth

DOI10.4230/LIPICS.CSL.2020.15MaRDI QIDQ5874201zbMATH OpenOpenAlexFDO

Authors Yijia Chen, Jörg Flum

Publication date 7 February 2023

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2020/11658/pdf/LIPIcs-CSL-2020-15.pdf/

zbMATH Keywords

model-checkingmonadic second-order logicshrub-depth

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cited in

(4)

• Parameterized Parallel Computing and First-Order Logic
• Forbidden induced subgraphs and the Łoś-Tarski theorem
• On algorithms based on finitely many homomorphism counts
• Towards exact structural thresholds for parameterized complexity

This page was built for publication: FO-Definability of Shrub-Depth

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874201)