Pages that link to "Item:Q2084964"
From MaRDI portal
The following pages link to On the proof complexity of logics of bounded branching (Q2084964):
Displaying 9 items.
- A new face of the branching recurrence of computability logic (Q712555) (← links)
- Substitution Frege and extended Frege proof systems in non-classical logics (Q1023047) (← links)
- A defense of branching quantification (Q1313374) (← links)
- Proof complexity of substructural logics (Q2032997) (← links)
- Proof complexity of monotone branching programs (Q2104254) (← links)
- (Q4448378) (← links)
- On Computability of Logical Approaches to Branching-Time Property Verification of Programs (Q5145688) (← links)
- (Q5874198) (← links)
- On the proof complexity of logics of bounded branching (Q6339312) (← links)