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 sense that the interpretation of Q varies with the structures. The second result considers the extension of dependence logic where Q is interpreted as there exist uncountably many. Both of the axiomatizations are shown to be sound and complete for FO(Q) consequences. © 2013 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Engström, F., Kontinen, J., & Väänänen, J. (2013). Dependence logic with generalized quantifiers: Axiomatizations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8071 LNCS, pp. 138–152). Springer Verlag. https://doi.org/10.1007/978-3-642-39992-3_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
