On definability in dependence logic

Journal of Logic, Language and Information 18 (3):317-332 (2009)
  Copy   BIBTEX

Abstract

We study the expressive power of open formulas of dependence logic introduced in Väänänen [Dependence logic (Vol. 70 of London Mathematical Society Student Texts), 2007]. In particular, we answer a question raised by Wilfrid Hodges: how to characterize the sets of teams definable by means of identity only in dependence logic, or equivalently in independence friendly logic.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,261

External links

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

Through your library

Analytics

Added to PP
2009-02-16

Downloads
94 (#184,005)

6 months
17 (#151,744)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Jouko A Vaananen
University of Helsinki

Citations of this work

Dependence and Independence.Erich Grädel & Jouko Väänänen - 2013 - Studia Logica 101 (2):399-410.
Propositional logics of dependence.Fan Yang & Jouko Väänänen - 2016 - Annals of Pure and Applied Logic 167 (7):557-589.
Generalized Quantifiers in Dependence Logic.Fredrik Engström - 2012 - Journal of Logic, Language and Information 21 (3):299-324.

View all 35 citations / Add more citations

References found in this work

The principles of mathematics revisited.Jaakko Hintikka - 1996 - New York: Cambridge University Press.
The Principles of Mathematics Revisited.Jaakko Hintikka - 1996 - New York: Cambridge University Press.
Compositional semantics for a language of imperfect information.W. Hodges - 1997 - Logic Journal of the IGPL 5 (4):539-563.
Finite partially-ordered quantification.Wilbur John Walkoe Jr - 1970 - Journal of Symbolic Logic 35 (4):535-555.

View all 12 references / Add more references