Dependence Logic with Generalized Quantifiers: Axiomatizations
classification
🧮 math.LO
cs.LO
keywords
dependencelogicaxiomatizationsextensiongeneralizedinterpretationweakcomplete
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.