The following pages link to Computer Science Logic (Q5394588):
Displaying 6 items.
- Complexity of two-variable dependence logic and IF-logic (Q476186) (← links)
- Complexity of syntactical tree fragments of independence-friendly logic (Q2003922) (← links)
- Boolean dependence logic and partially-ordered connectives (Q2361349) (← links)
- A fragment of dependence logic capturing polynomial time (Q2878749) (← links)
- DICHOTOMY RESULT FOR INDEPENDENCE-FRIENDLY PREFIXES OF GENERALIZED QUANTIFIERS (Q5177884) (← links)
- A Logic for True Concurrency (Q5501929) (← links)