Dependence logic with generalized quantifiers Axiomatizations

Authors
Publication date 09-2017
Journal Journal of Computer and System Sciences
Volume | Issue number 88
Pages (from-to) 90-102
Number of pages 13
Organisations
  • Interfacultary Research - Institute for Logic, Language and Computation (ILLC)
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.

Document type Article
Language English
Published at https://doi.org/10.1016/j.jcss.2017.03.010
Other links https://www.scopus.com/pages/publications/85017336252
Permalink to this page
Back