On definability in dependence logic
J Kontinen, J Väänänen - Journal of Logic, Language and Information, 2009 - Springer
Journal of Logic, Language and Information, 2009•Springer
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.
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.
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.
Springer
