On the logic of informational independence and its applications

Journal of Philosophical Logic 22 (1):29 - 60 (1993)
Abstract
We shall introduce in this paper a language whose formulas will be interpreted by games of imperfect information. Such games will be defined in the same way as the games for first-order formulas except that the players do not have complete information of the earlier course of the game. Some simple logical properties of these games will be stated together with the relation of such games of imperfect information to higher-order logic. Finally, a set of applications will be outlined
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: 11,085
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
Jon Barwise (1979). On Branching Quantifiers in English. Journal of Philosophical Logic 8 (1):47 - 80.
Herbert B. Enderton (1970). Finite Partially‐Ordered Quantifiers. Mathematical Logic Quarterly 16 (8):393-397.

View all 9 references

Citations of this work BETA
Tero Tulenheimo (2009). Hybrid Logic Meets If Modal Logic. Journal of Logic, Language and Information 18 (4):559-591.

View all 6 citations

Similar books and articles
Analytics

Monthly downloads

Added to index

2009-01-28

Total downloads

19 ( #89,058 of 1,101,673 )

Recent downloads (6 months)

7 ( #35,000 of 1,101,673 )

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.