Dependence logic with generalized quantifiers: axiomatizations
From MaRDI portal
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.
Recommendations
Cited in
(11)- Generalized quantifiers in dependence logic
- Dependence logic with generalized quantifiers: axiomatizations
- Boolean dependence logic and partially-ordered connectives
- Dependence logic with a majority quantifier
- Dependence logic with a majority quantifier
- A double team semantics for generalized quantifiers
- Axiomatizing first-order consequences in dependence logic
- Correspondence and Completeness for Generalized Quantifiers
- Characterizing quantifier extensions of dependence logic
- On natural deduction in dependence logic
- SOME OBSERVATIONS ABOUT GENERALIZED QUANTIFIERS IN LOGICS OF IMPERFECT INFORMATION
This page was built for publication: Dependence logic with generalized quantifiers: axiomatizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2849428)