Finite and Infinite Dialogues

作者: Rohit Parikh

DOI: 10.1007/978-1-4612-2822-6_18

关键词:

摘要: We consider dialogues over both specific and general Kripke structures where individuals convey acquire knowledge through statements. show that conventional ‘proofs’ of the existence actually correspond to optimal strategies (which may not occur when real talk). Sometimes these optimal, (and hence all) need be transfinite in can only acquired at some infinite ordinal. However, situation changes sharply we geared acquiring but taking a justified risk.

参考文章(14)
John Edensor Littlewood, A mathematician's miscellany ,(1953)
Rohit Parikh, Levels of Knowledge in Distributed Computing logic in computer science. pp. 314- 321 ,(1986)
Yiannis Nicholas Moschovakis, Yiannis Nicholas Moschovakis, Descriptive Set Theory ,(1980)
Rohit Parikh, Logics of Knowledge, Games and Dynamic Logic foundations of software technology and theoretical computer science. pp. 202- 222 ,(1984) , 10.1007/3-540-13883-8_74
Rohit Parikh, R. Ramanujam, Distributed Processes and the Logic of Knowledge Proceedings of the Conference on Logic of Programs. pp. 256- 268 ,(1985) , 10.1007/3-540-15648-8_21
Clifford Spector, Recursive Well-Orderings Journal of Symbolic Logic. ,vol. 20, pp. 151- 163 ,(1955) , 10.2307/2266902
Joseph Y. Halpern, Yoram Moses, Knowledge and common knowledge in a distributed environment Journal of the ACM. ,vol. 37, pp. 549- 587 ,(1990) , 10.1145/79147.79161
Brian MacWhinney, Aravind K. Joshi, Bonnie L. Webber, Ivan A. Sag, Elements of Discourse Understanding Language. ,vol. 59, pp. 214- ,(1983) , 10.2307/414072
Rohit Parikh, Paul Krasucki, Communication, consensus, and knowledge Journal of Economic Theory. ,vol. 52, pp. 178- 189 ,(1990) , 10.1016/0022-0531(90)90073-S