Games of imperfect information and and modal logic

Abstract
numbers as in the following example ♦1,1♦1,2 2,3 5,4p We denote the set of formulas of this modal language by M L(k). For each modality type i, there will be an accessibility relation Ri. That is, an k-ary modal structure for the modal propositional language L will have the form..
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 Translate to english
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 11,018
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

No references found.

Citations of this work BETA

No citations found.

Similar books and articles
Analytics

Monthly downloads

Added to index

2009-09-15

Total downloads

17 ( #97,260 of 1,101,073 )

Recent downloads (6 months)

0

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.