On the strength of temporal proofs
- 31 December 1991
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 80 (2) , 125-151
- https://doi.org/10.1016/0304-3975(91)90386-g
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Recursive programs and denotational semantics in absolute logics of programsTheoretical Computer Science, 1990
- Weak second order characterizations of various program verification systemsTheoretical Computer Science, 1989
- The power of temporal proofsTheoretical Computer Science, 1989
- Non-standard algorithmic and dynamic logicJournal of Symbolic Computation, 1986
- A completeness theorem for dynamic logic.Notre Dame Journal of Formal Logic, 1985
- A complete logic for reasoning about programs via nonstandard model theory IITheoretical Computer Science, 1982
- A complete logic for reasoning about programs via nonstandard model theory ITheoretical Computer Science, 1982
- Programs and program verifications in a general settingTheoretical Computer Science, 1981
- On the termination of program schemasInformation and Control, 1975
- To the memory of Arthur Prior Formal properties of ‘now’Theoria, 1971