Axiomatization of 'peircean' branching-time logic

Studia Logica 49 (2):183 - 195 (1990)
  Copy   BIBTEX

Abstract

The branching-time logic called Peircean by Arthur Prior is considered and given an infinite axiomatization. The axiomatization uses only the standard deduction rules for tense logic.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,458

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Decidability for branching time.John P. Burgess - 1980 - Studia Logica 39 (2-3):203-218.
Temporal Logics with Reference Pointers and Computation Tree Logics.Valentin Goranko - 2000 - Journal of Applied Non-Classical Logics 10 (3):221-242.
An axiomatization of full computation tree logic.M. Reynolds - 2001 - Journal of Symbolic Logic 66 (3):1011-1057.
Undivided and indistinguishable histories in branching-time logics.Alberto Zanardo - 1998 - Journal of Logic, Language and Information 7 (3):297-315.
T × W Completeness.Franz von Kutschera - 1997 - Journal of Philosophical Logic 26 (3):241-250.
T × W Completeness.Franz Kutschervona - 1997 - Journal of Philosophical Logic 26 (3):241-250.

Analytics

Added to PP
2009-01-28

Downloads
123 (#177,000)

6 months
16 (#190,197)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Decidability for branching time.John P. Burgess - 1980 - Studia Logica 39 (2-3):203-218.

Add more references