David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Studia Logica 75 (1):31-62 (2003)
Suppose we have a stack of cards that is divided over some players. For certain distributions of cards it is possible to communicate your hand of cards to another player by public announcements, without yet another player learning any of your cards. A solution to this problem consists of some sequence of announcements and is called an exchange. It is called a direct exchange if it consists of (the minimum of) two announcements only. The announcements in an exchange have a special form: they are safe communications, an interesting new form of update. Certain unsafe communications turn out to be unsuccessful updates. A communication is a public announcement that is known to be true. Each communication may be about a set of alternative card deals only, and even about a set of alternatives to the communicating player's own hand only. We list the direct exchanges for a deal of seven cards where the two players holding three cards communicate their hands to each other. Our work may be applicable to the design of cryptographic protocols.
|Keywords||Philosophy Logic Mathematical Logic and Foundations Computational Linguistics|
|Categories||categorize this paper)|
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
Hans P. van Ditmarsch (2005). The Case of the Hidden Hand. Journal of Applied Non-Classical Logics 15 (4):437-452.
Yanjing Wang & Qinxiang Cao (2013). On Axiomatizations of Public Announcement Logic. Synthese (S1):1-32.
Wesley H. Holliday, Tomohiro Hoshi & Thomas F. Icard Iii (2013). Information Dynamics and Uniform Substitution. Synthese 190 (1):31-55.
Francien Dechesne & Yanjing Wang (2010). To Know or Not to Know: Epistemic Approaches to Security Protocol Verification. Synthese 177 (Supplement-1):51-76.
Jan van Eijck & Yanjing Wang (2011). Composing Models. Journal of Applied Non-Classical Logics 21 (3-4):397-425.
Similar books and articles
Hans Van Ditmarsch & Barteld Kooi (2006). The Secret of My Success. Synthese 153 (2):201 - 232.
Hans Van Ditmarsch & Barteld Kooi (2006). The Secret of My Success. Synthese 151 (2):201-232.
Barteld Kooi & Hans Van Ditmarsch (2006). The Secret of My Success. Synthese 153 (2):201 - 232.
Steve Clarke & Justin Oakley (2004). Informed Consent and Surgeons' Performance. Journal of Medicine and Philosophy 29 (1):11 – 35.
Erica Lucas & Linden Ball (2005). Think-Aloud Protocols and the Selection Task: Evidence for Relevance Effects and Rationalisation Processes. Thinking and Reasoning 11 (1):35 – 66.
Klaus Oberauer, Oliver Wilhelm & Ricardo Rosas Diaz (1999). Bayesian Rationality for the Wason Selection Task? A Test of Optimal Data Selection Theory. Thinking and Reasoning 5 (2):115 – 144.
Hans P. Van Ditmarsch (2006). The Logic of Pit. Synthese 149 (2):343 - 374.
Hans P. Van Ditmarsch (2006). The Logic of Pit. Synthese 149 (2):343-374.
Hans Van Ditmarsch (2003). The Russian Cards Problem. Studia Logica 75 (1):31 - 62.
Michael Dummett & Kamal Abu-Deeb (1973). Some Remarks on Mamluk Playing Cards. Journal of the Warburg and Courtauld Institutes 36:106-128.
Added to index2009-01-28
Total downloads14 ( #184,535 of 1,726,249 )
Recent downloads (6 months)4 ( #183,615 of 1,726,249 )
How can I increase my downloads?