Non-standard algorithmic and dynamic logic
- 31 March 1986
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 2 (1) , 59-81
- https://doi.org/10.1016/s0747-7171(86)80013-x
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Non-standard fixed points in first order logicPublished by Springer Nature ,1984
- Arithmetical interpretations of dynamic logicThe Journal of Symbolic Logic, 1983
- On the strength of “sometimes” and “always” in program verificationInformation and Control, 1983
- Nonstandard models in Propositional Dynamic LogicLecture Notes in Computer Science, 1983
- 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
- Ten Years of Hoare's Logic: A Survey—Part IACM Transactions on Programming Languages and Systems, 1981
- Making dynamic logic first-orderPublished by Springer Nature ,1981
- Completeness problems in verification of programs and program schemesPublished by Springer Nature ,1979
- Completeness in the theory of typesThe Journal of Symbolic Logic, 1950