Pages that link to "Item:Q688859"
From MaRDI portal
The following pages link to On the complexity of arithmetical interpretations of modal formulae (Q688859):
Displaying 8 items.
- An arithmetical completeness theorem for pre-permutations (Q689195) (← links)
- On the interpretability of arithmetic in temporal logic (Q915718) (← links)
- The logic of arithmetical hierarchy (Q1315831) (← links)
- Modal-epistemic variants of Shapiro's system of epistemic arithmetic (Q1344441) (← links)
- A course on bimodal provability logic (Q1891253) (← links)
- A short note on essentially \(\Sigma_1\) sentences (Q1945709) (← links)
- Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic (Q4358049) (← links)
- Computer Science Logic (Q5292653) (← links)