首页 | 官方网站   微博 | 高级检索  
     


On Definability in Dependence Logic
Authors:Juha Kontinen  Jouko Väänänen
Affiliation:(1) Department of Mathematics and Statistics, University of Helsinki, P.O. Box 68, 00014 University of Helsinki, Finland;(2) ILLC, University of Amsterdam, Amsterdam, The Netherlands;(3) Department of Mathematics and Statistics, University of Helsinki, Helsinki, Finland
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
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号