On definability in dependence logic

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.
Keywords Dependence logic  Independence friendly logic  Team
Categories (categorize this paper)
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 10,978
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA
Herbert B. Enderton (1970). Finite Partially‐Ordered Quantifiers. Mathematical Logic Quarterly 16 (8):393-397.

View all 6 references

Citations of this work BETA
Fredrik Engström (2012). Generalized Quantifiers in Dependence Logic. Journal of Logic, Language and Information 21 (3):299-324.
Jouko Väänänen (2011). Erratum To: On Definability in Dependence Logic. [REVIEW] Journal of Logic, Language and Information 20 (1):133-134.

View all 6 citations

Similar books and articles
Analytics

Monthly downloads

Added to index

2009-02-16

Total downloads

15 ( #107,679 of 1,100,902 )

Recent downloads (6 months)

3 ( #115,721 of 1,100,902 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Start a new thread
Order:
There  are no threads in this forum
Nothing in this forum yet.