Axiomatization of 'peircean' branching-time logic

Studia Logica 49 (2):183 - 195 (1990)
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.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1007/BF00935598
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history
Request removal from index
Download options
Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 26,213
Through your library
References found in this work BETA
Decidability for Branching Time.John P. Burgess - 1980 - Studia Logica 39 (2-3):203-218.

Add more references

Citations of this work BETA
Derivation Rules as Anti-Axioms in Modal Logic.Yde Venema - 1993 - Journal of Symbolic Logic 58 (3):1003-1034.

Add more citations

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.

Monthly downloads

Added to index


Total downloads

29 ( #173,330 of 2,154,182 )

Recent downloads (6 months)

1 ( #397,226 of 2,154,182 )

How can I increase my downloads?

My notes
Sign in to use this feature

There  are no threads in this forum
Nothing in this forum yet.

Other forums