Completeness of a Branching-Time Logic with Possible Choices

Authors:
Roberto Ciuni;Alberto Zanardo
Affiliations:
Department of Philosophy, Delft University of Technology, Delft, Netherlands 2628 BX;Department of Pure and Applied Mathematics, University of Padova, Padova, Italy 35121
Venue:
Studia Logica
Year:
2010

Citing 9
Cited 1

Decision procedures and expressiveness in the temporal logic of branching time

Journal of Computer and System Sciences
“Sometimes” and “not never” revisited: on branching versus linear time temporal logic

Journal of the ACM (JACM) - The MIT Press scientific computation series
Alternating-time temporal logic

Journal of the ACM (JACM)
Undivided and Indistinguishable Histories in Branching-Time Logics

Journal of Logic, Language and Information
Deciding branching time logic

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Complete axiomatization and decidability of alternating-time temporal logic

Theoretical Computer Science
Knowing how to play: uniform choices in logics of agency

AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Embedding Alternating-time Temporal Logic in Strategic Logic of Agency

Journal of Logic and Computation
From Coalition Logic to STIT

Electronic Notes in Theoretical Computer Science (ENTCS)

Indistinguishability, Choices, and Logics of Agency

Studia Logica

Quantified Score

Hi-index	0.00

Visualization

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.