[BOOK][B] Algorithmic knowledge and game theory

K Binmore, HS Shin - 1992 - books.google.com
... In particular, the ugly duckling (G4) of the modal logic G is justified by an appeal to Lob's theorem,
which asserts that Prov (fVl)-»< p is ... 1. There is a precise sense in which algorithmic players with
comput- able powers have common knowledge of those features of the game that ...

Foundations of game theory

K Binmore - J.-J. Laffont (Ed.), Advances in Economic Theory, …, 1992 - books.google.com
... The relevant limitation on algorithmic knowledge appears as (G: 4). It is called Lob's theorem
in proof theory, where it is shown to be ... This step ensures that it is" common knowledge" how the
players" reason." Given a game prefixed by such an exchange of Godel numbers, call a ...

[HTML][HTML] Provability logic

RLC Verbrugge - 2003 - stanford.library.sydney.edu.au
... Ironically, the first time that the formalized version of Löb's theorem was stated as the modal
principle. ... Some other well-known modal logics, like epistemic logic with common knowledge,
are decidable in EXPTIME, thus they may be more complex than GL, depending on the ...

Truth and paradox: a philosophical sketch

J Beall - Philosophy of logic, 2007 - books.google.com
Page 342. TRUTH AND PARADOX: A PHILOSOPHICAL SKETCH JC Beall 1 AIMS
AND STRUCTURE OF THIS ESSAY Because of the many surveys or otherwise
readable discussions of truth and para- dox, I have tried to take ...

Create alert