2013/04/02 by Fredrik Engström, Engström, Fredrik, Juha Kontinen +3
Computer Science · Mathematics · #03C80 #F.4.1 #FOS: Computer and information sciences #FOS: Mathematics #Logic (math.LO) #Logic in Computer Science (cs.LO) #acm:03C80 #cs.LO #math.LO #msc:03C80
paper · pdf · doi:10.48550/arxiv.1304.0611
17 pages
arxiv created 2013/04/02 · arxiv updated 2013/04/03
We prove two completeness results, one for the extension of dependence logic by a monotone generalized quantifier Q with weak interpretation, weak in the meaning that the interpretation of Q varies with the structures. The second result considers the extension of dependence logic where Q is interpreted as "there exists uncountable many." Both of the axiomatizations are shown to be sound and complete for FO(Q) consequences.