A Programming Language for the Inductive Sets, and Applications (1984)
by
David Harel
,
Dexter Kozen
| Citations: | 8 - 2 self |
BibTeX
@MISC{Harel84aprogramming,
author = {David Harel and Dexter Kozen},
title = {A Programming Language for the Inductive Sets, and Applications},
year = {1984}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Structures," North-Holland, Amsterdam, 1974), r.e. dynamic logic is more expressive than finite-test dynamic logic. This refines a separation result of Meyer and Parikh ("Proc. 12th ACM Sympos. on Theory of Computing," 1979, pp.
Citations
| 743 | First-Order Dynamic Logic - Harel - 1997 |
| 641 | Predicate logic as a programming language - Kowalski - 1974 |
| 192 | Universality of data retrieval languages - Aho, Ullman - 1979 |
| 171 | Admissible Sets and Structures - Barwise - 1975 |
| 108 | Computable queries for relational data bases - Chandra, Harel |
| 107 | Soundness and completeness of an axiom system for program verification - Cook - 1978 |
| 6 | Definability in dynamic logic - Meyer, Parikh - 1981 |
| 5 | A relational model for large shared data bases - Codd - 1970 |
| 5 | The correctness of nondeterministic programs - Manna - 1970 |
| 1 | clauses and the fixpoint query hierarchy - CHNDR, HAP, et al. - 1982 |
| 1 | Relational completeAeneas of data base sublanguages - CObb - 1972 |
| 1 | A proof Rule for fair Termination of Guarded Commands - unknown authors |
| 1 | Relational queries computable in polynomial time - 1MMERMAN - 1982 |
| 1 | A Note of Equivalence Among - MEYER, TURYN |
| 1 | On the Expressive Power of Dynamic Logic - MEYER, WINKELMANN - 1979 |
