Pages that link to "Item:Q3345770"
From MaRDI portal
The following pages link to STRUCTURED NONSTANDARD DYNAMIC LOGIC (Q3345770):
Displaying 9 items.
- Total correctness in nonstandard logics of programs (Q580955) (← links)
- Peano arithmetic as axiomatization of the time frame in logics of programs and in dynamic logics (Q687278) (← links)
- On the strength of temporal proofs (Q809066) (← links)
- Non-standard algorithmic and dynamic logic (Q1077159) (← links)
- A simple dynamic logic (Q1087866) (← links)
- Hoare's logic for nondeterministic regular programs: A nonstandard approach (Q1822934) (← links)
- Is ``Some-other-time'' sometimes better than ``Sometime'' for proving partial correctness of programs? (Q1825630) (← links)
- Recursive programs and denotational semantics in absolute logics of programs (Q2639051) (← links)
- Does “N+1 times” prove more programs correct than “N times”? (Q5887528) (← links)
