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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 89,703

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

An axiomatization of full computation tree logic.M. Reynolds - 2001 - Journal of Symbolic Logic 66 (3):1011-1057.
Decidability for branching time.John P. Burgess - 1980 - Studia Logica 39 (2-3):203-218.
T × W Completeness.Franz Kutschervona - 1997 - Journal of Philosophical Logic 26 (3):241-250.
A complete deductive-system for since-until branching-time logic.Alberto Zanardo - 1991 - Journal of Philosophical Logic 20 (2):131 - 148.
A note about the axioms for branching-time logic.Alberto Zanardo - 1992 - Notre Dame Journal of Formal Logic 33 (2):225-228.
Undivided and indistinguishable histories in branching-time logics.Alberto Zanardo - 1998 - Journal of Logic, Language and Information 7 (3):297-315.

Analytics

Added to PP
2009-01-28

Downloads
89 (#173,311)

6 months
4 (#313,854)

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