The following pages link to Subclasses of binary NP (Q4399718):
Displaying 9 items.
- Existential second-order logic and modal logic with quantified accessibility relations (Q259071) (← links)
- Hybrid logic meets IF modal logic (Q1047800) (← links)
- The closure of monadic NP (Q1577017) (← links)
- Linear time and the power of one first-order universal quantifier (Q1854556) (← links)
- Closure properties of locally finite \(\omega\)-languages (Q1885033) (← links)
- Semantic Restrictions over Second-Order Logic (Q3458159) (← links)
- Comparing the Power of Games on Graphs (Q4366126) (← links)
- Expressiveness of Logic Programs under the General Stable Model Semantics (Q5278207) (← links)
- Turing-Complete Subclasses of CHR (Q5504695) (← links)
