Jonathan Stavi

According to our database1, Jonathan Stavi authored at least 14 papers between 1973 and 1990.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

1990
On Models of the Elementary Theory of (Z, +, 1).
J. Symb. Log., 1990

1984
Fair Termination Revisited-With Delay.
Theor. Comput. Sci., 1984

Countably decomposable admissible sets.
Ann. Pure Appl. Log., 1984

1983
On the Standard Part of Nonstandard Models of Set Theory.
J. Symb. Log., 1983

Propositional Dynamic Logic of Nonregular Programs.
J. Comput. Syst. Sci., 1983

1981
Further Results on Propositional Dynamic Logic of Nonregular Programs.
Proceedings of the Logics of Programs, Workshop, Yorktown Heights, New York, USA, May 1981, 1981

Impartiality, Justice and Fairness: The Ethics of Concurrent Termination.
Proceedings of the Automata, 1981

Propositional Dynamic Logic of Context-Free Programs
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.
J. Symb. Log., 1980

On the Temporal Analysis of Fairness.
Proceedings of the Conference Record of the Seventh Annual ACM Symposium on Principles of Programming Languages, 1980

1977
The Pure Part of HYP(M).
J. Symb. Log., 1977

A Complete Axiomatic System for Proving Deductions about Recursive Programs
Proceedings of the 9th Annual ACM Symposium on Theory of Computing, 1977

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

A Converse of the Barwise Completeness Theorem.
J. Symb. Log., 1973


  Loading...