Author of the publication

Reasoning about Common Knowledge with Infinitely Many Agents.

, and . LICS, page 384-393. IEEE Computer Society, (1999)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

The n-R.E. Degrees: Undecidability and σ1 Substructures., , and . J. Math. Log., 12 (1): 1250005 (2012)Intervals Without Critical Triples., , and . Logic Colloquium, volume 11 of Lecture Notes in Logic, page 17-43. Springer, (1995)Logic for Applications., and . Texts and Monographs in Computer Science Springer, (1993)The settling-time reducibility ordering., and . J. Symb. Log., 72 (3): 1055-1071 (2007)The Theory of the Recursively Enumerable Weak Truth-Table Degrees Is Undecidability., , and . J. Symb. Log., 57 (3): 864-874 (1992)Reasoning about common knowledge with infinitely many agents., and . Inf. Comput., 191 (1): 1-40 (2004)Lattice initial segments of the hyperdegrees., and . J. Symb. Log., 75 (1): 103-130 (2010)Decomposition and infima in the computably enumerable degrees., , and . J. Symb. Log., 68 (2): 551-579 (2003)Computing maximal chains., , and . Arch. Math. Log., 51 (5-6): 651-660 (2012)The prospects for mathematical logic in the twenty-first century, , , and . CoRR, (2002)