Sciweavers

APAL
2005

Finite information logic

14 years 15 days ago
Finite information logic
We introduce a generalization of Independence Friendly (IF) logic in which Eloise (the player) is restricted to a finite amount of information about Abelard's ('s) moves. This logic is shown to be equivalent to a sublogic of first-order logic, to have the finite model property, and to be decidable. Moreover, it gives an exponential compression relative to logic.
Rohit Parikh, Jouko A. Väänänen
Added 15 Dec 2010
Updated 15 Dec 2010
Type Journal
Year 2005
Where APAL
Authors Rohit Parikh, Jouko A. Väänänen
Comments (0)