Definability in dynamic logic

An application of games to the completeness problem for formalized theories

Andrzej Ehrenfeucht · Fundamenta Mathematicae · 1961 · 613 citations · Full text

Computing, Computer Science, Mathematics +14

Proving termination with multiset orderings

Nachum Dershowitz, Zohar Manna · Communications of the ACM · 1979 · 540 citations · Full text

Computing, Computer Science, Algorithms +12

Foundations of computer science

Viera K. Proulx, Richard Rasala, Harriet Fell · ACM SIGCSE Bulletin · 1996 · 161 citations · Full text

Computing, Computer Science, Mathematics +15

Finiteness is mu-ineffable

David Park · Theoretical Computer Science · 1976 · 95 citations

Computability and completeness in logics of programs (Preliminary Report)

David Harel, Albert R. Meyer, Vaughan Pratt · 1977 · 76 citations

Computing, Computer Science, Mathematics +17