Skip to main content
SpringerLink
Log in

Decidability for branching time

  • Published:
Studia Logica Aims and scope Submit manuscript

Abstract

The species of indeterminist tense logic called ‘Peircean’ by A. N. Prior is proved to be recursively decidable.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J. P. Burgess, The unreal future, Theoria 44(1978), pp. 157–179.

    Google Scholar 

  2. A. N. Prior, Past, Present and Future, Oxford, Calrendon, 1967.

    Google Scholar 

  3. M. O. Rabin, Decidability of second order theories and automata on infinite trees, Transaction of the American Mathematical Society 141 (1966), pp. 1–35.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Philosophy, Princeton University, USA

    John P. Burgess

Authors
  1. John P. Burgess
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

To the memory of Ivo Thomas

Rights and permissions

Reprints and permissions

About this article

Cite this article

Burgess, J.P. Decidability for branching time. Stud Logica 39, 203–218 (1980). https://doi.org/10.1007/BF00370320

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00370320

Keywords

Search

Navigation