Finite information logic

Annals of Pure and Applied Logic 134 (1):83-93 (2005)
  Copy   BIBTEX

Abstract

We introduce a generalization of Independence Friendly logic in which Eloise is restricted to a finite amount of information about Abelard’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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

About finite predicate logic.Herman Dishkant - 1986 - Studia Logica 45 (4):405 - 414.
Modal logic over finite structures.Eric Rosen - 1997 - Journal of Logic, Language and Information 6 (4):427-439.
Two information measures for inconsistent sets.Kevin M. Knight - 2003 - Journal of Logic, Language and Information 12 (2):227-248.
On definability in dependence logic.Juha Kontinen & Jouko Väänänen - 2009 - Journal of Logic, Language and Information 18 (3):317-332.
On representing concepts in finite models.Marcin Mostowski - 2001 - Mathematical Logic Quarterly 47 (4):513-523.
Erratum to: On Definability in Dependence Logic. [REVIEW]Jouko Väänänen - 2011 - Journal of Logic, Language and Information 20 (1):133-134.
Formulas in modal logic s4.Katsumi Sasaki - 2010 - Review of Symbolic Logic 3 (4):600-627.
Unary quantifiers on finite models.Jouko Väänänen - 1997 - Journal of Logic, Language and Information 6 (3):275-304.
Expansion and contraction of finite states.Allard Tamminga - 2004 - Studia Logica 76 (3):427-442.

Analytics

Added to PP
2014-01-16

Downloads
14 (#961,492)

6 months
4 (#818,853)

Historical graph of downloads
How can I increase my downloads?