First order logic on Pathwidth revisited again

DOI10.4230/LIPICS.ICALP.2023.132MaRDI QIDQ6638142zbMATH OpenFDO

Authors Michael Lampis

Publication date 14 November 2024

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2023.132

zbMATH Keywords

algorithmic meta-theoremsFO logicPathwidth

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cited in

(2)

• On classes of bounded tree rank, their interpretations, and efficient sparsification
• Elementary first-order model checking for sparse graphs

This page was built for publication: First order logic on Pathwidth revisited again

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