Pages that link to "Item:Q2879254"
From MaRDI portal
The following pages link to Completeness and Decidability Results for CTL in Coq (Q2879254):
Displaying 5 items.
- Completeness and decidability results for CTL in constructive type theory (Q287375) (← links)
- Certifying standard and stratified Datalog inference engines in SSReflect (Q1687733) (← links)
- A henkin-style completeness proof for the modal logic S5 (Q2695534) (← links)
- (Q4218844) (← links)
- The formal strong completeness of partial monoidal Boolean BI (Q5739976) (← links)