Completeness of a branching-time logic with possible choices

Studia Logica 96 (3):393-420 (2010)
Abstract
In this paper we present BTC, which is a complete logic for branchingtime whose modal operator quantifies over histories and whose temporal operators involve a restricted quantification over histories in a given possible choice. This is a technical novelty, since the operators of the usual logics for branching-time such as CTL express an unrestricted quantification over histories and moments. The value of the apparatus we introduce is connected to those logics of agency that are interpreted on branching-time, as for instance Stit Logics
Keywords No keywords specified (fix it)
Categories (categorize this paper)
Options
 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
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 10,337
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA
Citations of this work BETA
Similar books and articles
Volker Weber (2009). Branching-Time Logics Repeatedly Referring to States. Journal of Logic, Language and Information 18 (4):593-624.
Franz Kutschervona (1997). T × W Completeness. Journal of Philosophical Logic 26 (3):241-250.
Franz von Kutschera (1997). T × W Completeness. Journal of Philosophical Logic 26 (3):241 - 250.
Analytics

Monthly downloads

Added to index

2010-12-08

Total downloads

32 ( #52,021 of 1,096,609 )

Recent downloads (6 months)

5 ( #51,759 of 1,096,609 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Start a new thread
Order:
There  are no threads in this forum
Nothing in this forum yet.