Jonathan Stavi

J. Symb. Log., 1990

1984

Fair Termination Revisited-With Delay.

[BibT_eX]

[DOI]

Krzysztof R. Apt

Theor. Comput. Sci., 1984

Countably decomposable admissible sets.

[BibT_eX]

[DOI]

Menachem Magidor

Saharon Shelah

Ann. Pure Appl. Log., 1984

1983

On the Standard Part of Nonstandard Models of Set Theory.

[BibT_eX]

[DOI]

Menachem Magidor

Saharon Shelah

J. Symb. Log., 1983

Propositional Dynamic Logic of Nonregular Programs.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1983

1981

Further Results on Propositional Dynamic Logic of Nonregular Programs.

[BibT_eX]

[DOI]

Proceedings of the Logics of Programs, Workshop, Yorktown Heights, New York, USA, May 1981, 1981

Impartiality, Justice and Fairness: The Ethics of Concurrent Termination.

[BibT_eX]

[DOI]

Daniel Lehmann

Proceedings of the Automata, 1981

Propositional Dynamic Logic of Context-Free Programs

[BibT_eX]

[DOI]

Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981

1980

Triangle <sup>0</sup><sub>2</sub> Operators and Alternating Sentences in Arithmetic.

[BibT_eX]

[DOI]

Larry M. Manevitz

J. Symb. Log., 1980

On the Temporal Analysis of Fairness.

[BibT_eX]

[DOI]

Proceedings of the Conference Record of the Seventh Annual ACM Symposium on Principles of Programming Languages, 1980

1977

The Pure Part of HYP(M).

[BibT_eX]

[DOI]

Mark E. Nadel

J. Symb. Log., 1977

A Complete Axiomatic System for Proving Deductions about Recursive Programs

[BibT_eX]

[DOI]

Proceedings of the 9th Annual ACM Symposium on Theory of Computing, 1977

1973

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

[BibT_eX]

[DOI]

PhD thesis, 1973

A Converse of the Barwise Completeness Theorem.

[BibT_eX]

[DOI]