Pages that link to "Item:Q3975138"
From MaRDI portal
The following pages link to On the strength of temporal proofs (Q3975138):
Displaying 9 items.
- The logic of ``initially'' and ``next'': complete axiomatization and complexity (Q294659) (← links)
- On the strength of temporal proofs (Q809066) (← links)
- ``During'' cannot be expressed by ``after'' (Q1085154) (← links)
- A Hoare-like proof system for analysing the computation time of programs (Q1091122) (← links)
- VARIABLE TRUTH (Q3317087) (← links)
- Results on the glory of the past (Q3976046) (← links)
- Past proves more invariance properties but not pca's (Q3979260) (← links)
- Similarity saturation for first order linear temporal logic with UNLESS (Q5236443) (← links)
- Does “N+1 times” prove more programs correct than “N times”? (Q5887528) (← links)