A Converse of the Barwise Completeness Theorem. - Jonathan Stavi (J. Symb. Log., 1973)

Boolean models for some expressive languages and their applications (מודלים בוליאניים לשפות עשירות ושימושיהם.). - Jonathan Stavi (1973)

A Complete Axiomatic System for Proving Deductions about Recursive Programs - David Harel; Amir Pnueli; Jonathan Stavi (STOC, 1977)

The Pure Part of HYP(M). - Mark E. Nadel; Jonathan Stavi (J. Symb. Log., 1977)

On the Temporal Analysis of Fairness. - Dov M. Gabbay; Amir Pnueli; Saharon Shelah; Jonathan Stavi (POPL, 1980)

Triangle 02 Operators and Alternating Sentences in Arithmetic. - Larry M. Manevitz; Jonathan Stavi (J. Symb. Log., 1980)

Propositional Dynamic Logic of Context-Free Programs - David Harel; Amir Pnueli; Jonathan Stavi (FOCS, 1981)

Impartiality, Justice and Fairness: The Ethics of Concurrent Termination. - Daniel Lehmann 001; Amir Pnueli; Jonathan Stavi (ICALP, 1981)

Further Results on Propositional Dynamic Logic of Nonregular Programs. - David Harel; Amir Pnueli; Jonathan Stavi (Logic of Programs, 1981)

Propositional Dynamic Logic of Nonregular Programs. - David Harel; Amir Pnueli; Jonathan Stavi (J. Comput. Syst. Sci., 1983)

On the Standard Part of Nonstandard Models of Set Theory. - Menachem Magidor; Saharon Shelah; Jonathan Stavi (J. Symb. Log., 1983)

Countably decomposable admissible sets. - Menachem Magidor; Saharon Shelah; Jonathan Stavi (Ann. Pure Appl. Log., 1984)

Fair Termination Revisited-With Delay. - Krzysztof R. Apt; Amir Pnueli; Jonathan Stavi (Theor. Comput. Sci., 1984)

On Models of the Elementary Theory of (Z, +, 1). - Mark E. Nadel; Jonathan Stavi (J. Symb. Log., 1990)