The following pages link to Computer Science Logic (Q5394590):
Displaying 5 items.
- On the \(\mu \)-calculus over transitive and finite transitive frames (Q606994) (← links)
- The determinacy strength of \(\Pi_2^1\)-comprehension (Q636381) (← links)
- Measure properties of regular sets of trees (Q2407093) (← links)
- Measure Properties of Game Tree Languages (Q2922025) (← links)
- An upper bound on the complexity of recognizable tree languages (Q5501862) (← links)