Pages that link to "Item:Q1159461"
From MaRDI portal
The following pages link to A complete logic for reasoning about programs via nonstandard model theory. II (Q1159461):
Displaying 17 items.
- Total correctness in nonstandard logics of programs (Q580955) (← links)
- Output concepts for accelerated Turing machines (Q609032) (← links)
- Peano arithmetic as axiomatization of the time frame in logics of programs and in dynamic logics (Q687278) (← links)
- A simple proof for the completeness of Floyd's method (Q801661) (← links)
- On the strength of temporal proofs (Q809066) (← links)
- An essay in combinatory dynamic logic (Q809068) (← links)
- Some questions about expressiveness and relative completeness in Hoare's logic (Q1064046) (← links)
- Non-standard algorithmic and dynamic logic (Q1077159) (← links)
- A simple dynamic logic (Q1087866) (← links)
- Some general incompleteness results for partial correctness logics (Q1110500) (← links)
- Weak second order characterizations of various program verification systems (Q1124311) (← links)
- Temporal logics need their clocks (Q1186428) (← links)
- Axiomatizing fixpoint logics (Q1190508) (← links)
- A unifying theorem for algebraic semantics and dynamic logics (Q1821095) (← links)
- Hoare's logic for nondeterministic regular programs: A nonstandard approach (Q1822934) (← links)
- On strictly arithmetical completeness in logics of programs (Q2277248) (← links)
- Recursive programs and denotational semantics in absolute logics of programs (Q2639051) (← links)
