In multi-agent epistemic logics, common knowledge has been a central consideration of study. A generic common knowledge (G.C.K.) system is one that yields iterated knowledge I(ϕ): 'any agent knows that any agent knows that any agent knows. . . ϕ' for any number of iterations. Generic common knowledge yields iterated knowledge
In this dissertation we study mathematical properties of generic common knowledge and compare them to the traditional common knowledge notion. In particular, we contrast the modal G.C.K. logics of McCarthy (e.g.
|Commitee:||Fitting, Melvin, Kossak, Roman|
|School:||City University of New York|
|School Location:||United States -- New York|
|Source:||DAI-B 74/07(E), Dissertation Abstracts International|
|Keywords:||Common knowledge, Epistemic logic, Generic common knowledge, Justification logic, Modal logic|
Copyright in each Dissertation and Thesis is retained by the author. All Rights Reserved
The supplemental file or files you are about to download were provided to ProQuest by the author as part of a
dissertation or thesis. The supplemental files are provided "AS IS" without warranty. ProQuest is not responsible for the
content, format or impact on the supplemental file(s) on our system. in some cases, the file type may be unknown or
may be a .exe file. We recommend caution as you open such files.
Copyright of the original materials contained in the supplemental file is retained by the author and your access to the
supplemental files is subject to the ProQuest Terms and Conditions of use.
Depending on the size of the file(s) you are downloading, the system may take some time to download them. Please be