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

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2004.06.013

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,757

External links

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

Through your library

My notes

Similar books and articles

Kolaitis Phokion G. and Väänänen Jouko A.. Generalized quantifiers and pebble games on finite structures. Annals of pure and applied logic, vol. 74 pp. 23–75. [REVIEW]I. A. Stewart - 1996 - Journal of Symbolic Logic 61 (4):1387-1388.
Lottery Semantics: A Compositional Semantics for Probabilistic First-Order Logic with Imperfect Information.Pietro Galliani & Allen L. Mann - 2013 - Studia Logica 101 (2):293-322.
Finite satisfiability for two‐variable, first‐order logic with one transitive relation is decidable.Ian Pratt-Hartmann - 2018 - Mathematical Logic Quarterly 64 (3):218-248.
Small substructures and decidability issues for first-order logic with two variables.Emanuel Kieroński & Martin Otto - 2012 - Journal of Symbolic Logic 77 (3):729-765.
On the Finite Model Property of Weak Intuitionistic Tense Logic.Yu Peng, Zhe Lin & Fei Liang - 2021 - In Sujata Ghosh & Thomas Icard (eds.), Logic, Rationality, and Interaction: 8th International Workshop, Lori 2021, Xi’an, China, October 16–18, 2021, Proceedings. Springer Verlag. pp. 174-182.
The fluted fragment with transitive relations.Ian Pratt-Hartmann & Lidia Tendera - 2022 - Annals of Pure and Applied Logic 173 (1):103042.
Loosely guarded fragment of first-order logic has the finite model property.Ian Hodkinson - 2002 - Studia Logica 70 (2):205 - 240.
Complexity and nicety of fluted logic.William C. Purdy - 2002 - Studia Logica 71 (2):177 - 198.
How to define a linear order on finite models.Lauri Hella, Phokion G. Kolaitis & Kerkko Luosto - 1997 - Annals of Pure and Applied Logic 87 (3):241-267.
First-order definability on finite structures.M. Ajtai - 1989 - Annals of Pure and Applied Logic 45 (3):211-225.

Analytics

Added to PP
2014-01-16

Downloads
36 (#632,936)

6 months
17 (#178,148)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Jouko A Vaananen
University of Helsinki
Rohit Parikh
CUNY Graduate Center

Citations of this work

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

Add more citations

References found in this work

Compositional semantics for a language of imperfect information.W. Hodges - 1997 - Logic Journal of the IGPL 5 (4):539-563.
Social Software.Rohit Parikh - 2002 - Synthese 132 (3):187-211.
On the semantics of informational independence.Jouko Väänänen - 2002 - Logic Journal of the IGPL 10 (3):339-352.

Add more references