Higher-order quantified Boolean satisfiability

DOI10.4230/LIPICS.MFCS.2022.33MaRDI QIDQ6584029zbMATH OpenFDO

Authors Dmitry Chistikov, Christoph Haase, Zahra Hadizadeh, Alessio Mansutti

Publication date 6 August 2024

zbMATH Keywords

Presburger arithmeticBoolean satisfiability problemnon-elementary complexityhigher-order Boolean functionsweak \(k\)-EXP hierarchies

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(1)

• Simply typed convertibility is \textsc{Tower}-complete even for safe lambda-terms

This page was built for publication: Higher-order quantified Boolean satisfiability

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