Pages that link to "Item:Q915716"
From MaRDI portal
The following pages link to Satisfiability of formulae with one \(\forall\) is decidable in exponential time (Q915716):
Displaying 4 items.
- Testable and untestable classes of first-order formulae (Q440006) (← links)
- The complexity of the satisfiability problem for Krom formulas (Q800915) (← links)
- Complete problems in the first-order predicate calculus (Q1075318) (← links)
- On the Decision Problem for Two-Variable First-Order Logic (Q4338040) (← links)