New answers tagged

4 votes
Accepted

Is there a generalized SAT problem for higher-order logics?

Yes, you may be interested in the paper "Higher-Order Quantified Boolean Satisfiability" by Chistikov, Haase, Hadizadeh, and Mansutti (https://doi.org/10.4230/LIPIcs.MFCS.2022.33)
Bartosz Bednarczyk's user avatar

Top 50 recent answers are included