Dependence Logic with Generalized Quantifiers: Axiomatizations
Logic
2013-04-03 v1 Logic in Computer Science
Abstract
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.
Keywords
Cite
@article{arxiv.1304.0611,
title = {Dependence Logic with Generalized Quantifiers: Axiomatizations},
author = {Fredrik Engström and Juha Kontinen and Jouko Väänänen},
journal= {arXiv preprint arXiv:1304.0611},
year = {2013}
}
Comments
17 pages