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

Other Versions

No versions found

Links

PhilArchive

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

The Logic of Approximate Dependence.Jouko Väänänen - 2017 - In Can Başkent, Lawrence Moss & Ramaswamy Ramanujam, Rohit Parikh on Logic, Language and Society. Cham, Switzerland: Springer Verlag. pp. 227-234.
The fluted fragment with transitive relations.Ian Pratt-Hartmann & Lidia Tendera - 2022 - Annals of Pure and Applied Logic 173 (1):103042.
Complexity and nicety of fluted logic.William C. Purdy - 2002 - Studia Logica 71 (2):177 - 198.

Analytics

Added to PP
2014-01-16

Downloads
147 (#291,029)

6 months
63 (#148,249)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Rohit Parikh
CUNY Graduate Center
Jouko A Vaananen
University of Helsinki

Citations of this work

Generalized quantifiers.Dag Westerståhl - 2008 - Stanford Encyclopedia of Philosophy.

Add more citations