<p>Yes, you may be interested in the paper &quot;Higher-Order Quantified Boolean Satisfiability&quot; by Chistikov, Haase, Hadizadeh, and Mansutti (<a href="https://doi.org/10.4230/LIPIcs.MFCS.2022.33" rel="nofollow noreferrer">https://doi.org/10.4230/LIPIcs.MFCS.2022.33</a>)</p>

CC BY-SA 4.0
2024-03-31T08:45:52.217Z
2024-03-31T10:07:07.067Z
2024-03-31T10:07:07.067Z
Bartosz Bednarczyk
<p>The SAT problem is based upon Boolean expressions, but is there a generalized SAT problem based upon higher order logics?</p>

CC BY-SA 4.0
2024-03-31T08:43:13.910Z
https://en.m.wikipedia.org/wiki/True_quantified_Boolean_formula
Laakeri
<lo.logic><sat><boolean-formulas><philosophy><generalizations>
Is there a generalized SAT problem for higher-order logics?
Geremia
# Is there a generalized SAT problem for higher-order logics?

(Asked by: username_0 on 2024-03-30)

The SAT problem is based upon Boolean expressions, but is there a generalized SAT problem based upon higher order logics?

**Tags:** lo.logic, sat, boolean-formulas, philosophy, generalizations

> **Comments:**
> **username_1**: https://en.m.wikipedia.org/wiki/True_quantified_Boolean_formula  

---

## 1 answers

### Answer by username_2 on 2024-03-31. Score: 4 | Accepted answer

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>)


---

