Israel Journal of Mathematics

, Volume 10, Issue 2, pp 135–146 | Cite as

Decidability results in non-classical logic. III

Systems with statability operators
  • Dov M. Gabbay
Article
Received:
Revised:

Abstract

A Kripke type semantics is given to a large class of tense logics with statability operators (including PriorsQK t) in such a manner as to obtain their decidability using Rabin’s theorem.

Keywords

Binary Relation Transitive Closure Decidability Result Propositional Variable Consistent Theory 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    R. A. Bull,Propositional quantifiers and statability, Mimeographed, University of Canterbury, Christchurch, Private Bay, New Zealand, 1970.Google Scholar
  2. 2.
    D. M. Gabbay,Decidability Results in Non-Classical Logics. I, II, IV., to appear.Google Scholar
  3. 3.
    A. N. Prior,Papers on Time and Tense, Oxford, 1970.Google Scholar
  4. 4.
    M. O. Rabin,Decidability of 2nd order theories and automata on trees, Trans. Amer. Math. Soc.121 (1969), 1–35.CrossRefMathSciNetGoogle Scholar
  5. 5.
    M. K. Rennie,Semantics for RKt, to appear.Google Scholar
  6. 6.
    K. Segerberg.Some modal logics based on three valued logic, Theoria33 (1967), 53–73.MATHMathSciNetCrossRefGoogle Scholar

Copyright information

© The Weizmann Science Press of Israel 1971

Authors and Affiliations

  • Dov M. Gabbay
    • 1
  1. 1.The Hebrew University of JerusalemIsrael

Personalised recommendations