Games of imperfect information and and modal logic


Authors
Gabriel Sandu
University of Helsinki
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
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Translate to english
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 53,558
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.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Generalized Quantifiers and Modal Logic.Wiebe Van Der Hoek & Maarten De Rijke - 1993 - Journal of Logic, Language and Information 2 (1):19-58.
Elementary Definability and Completeness in General and Positive Modal Logic.Ernst Zimmermann - 2003 - Journal of Logic, Language and Information 12 (1):99-117.
Modal Logic Over Finite Structures.Eric Rosen - 1997 - Journal of Logic, Language and Information 6 (4):427-439.
Modal Sequents and Definability.Bruce M. Kapron - 1987 - Journal of Symbolic Logic 52 (3):756-762.
On the Logic of Informational Independence and its Applications.Gabriel Sandu - 1993 - Journal of Philosophical Logic 22 (1):29 - 60.

Analytics

Added to PP index
2009-09-15

Total views
17 ( #567,071 of 2,348,460 )

Recent downloads (6 months)
0

How can I increase my downloads?

Downloads

My notes