Some relationships between logics of programs and complexity theory
- 31 March 1988
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 60 (1) , 83-108
- https://doi.org/10.1016/0304-3975(88)90052-7
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Equivalences among logics of programsJournal of Computer and System Sciences, 1984
- Unbounded program memory adds to the expressive power of first-order programming logicInformation and Control, 1984
- Nontrivial definability by flow-chart programsInformation and Control, 1983
- Deterministic dynamic logic is strictly weaker than dynamic logicInformation and Control, 1983
- A necessary and sufficient condition in order that a Herbrand interpretation be expressive relative to recursive programsInformation and Control, 1983
- Program Schemes with Pushdown StoresSIAM Journal on Computing, 1972
- On Classes of Program SchemataSIAM Journal on Computing, 1972
- Characterizations of Pushdown Machines in Terms of Time-Bounded ComputersJournal of the ACM, 1971