Tree-depth, quantifier elimination, and quantifier rank
From MaRDI portal
Publication:5145295
DOI10.1145/3209108.3209160zbMath1452.03086OpenAlexW2798639752MaRDI QIDQ5145295
Publication date: 20 January 2021
Published in: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3209108.3209160
Specification and verification (program logics, model checking, etc.) (68Q60) Model theory of finite structures (03C13) Quantifier elimination, model completeness, and related topics (03C10) Descriptive complexity and finite models (68Q19)
Related Items (3)
Parameterized Parallel Computing and First-Order Logic ⋮ Unnamed Item ⋮ On the Descriptive Complexity of Color Coding
This page was built for publication: Tree-depth, quantifier elimination, and quantifier rank
