Dependence logic with generalized quantifiers: axiomatizations

DOI10.1016/J.JCSS.2017.03.010MaRDI QIDQ2361348zbMATH OpenOpenAlexFDO

Authors Fredrik Engström, Juha Kontinen, Jouko Väänänen

Publication date 30 June 2017

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10138/214806

zbMATH Keywords

branching quantifiersdependence logicgeneralized quantifiersnatural deduction

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Logic with extra quantifiers and operators (03C80)

Recommendations

• Dependence logic with generalized quantifiers: axiomatizations
• Correspondence and Completeness for Generalized Quantifiers
• Dependence logic with a majority quantifier
• Generalized quantifiers in dependence logic
• Axiomatizing first-order consequences in dependence logic

Cites work

• Axiomatizing first-order consequences in dependence logic
• Characterizing quantifier extensions of dependence logic
• Compositional semantics for a language of imperfect information
• Definability of polyadic lifts of generalized quantifiers
• Dependence logic. A new approach to independence friendly logic
• Generalized quantifiers and pebble games on finite structures
• Generalized quantifiers in dependence logic
• scientific article; zbMATH DE number 6003856 (Why is no real title available?)
• scientific article; zbMATH DE number 3941494 (Why is no real title available?)
• scientific article; zbMATH DE number 4035805 (Why is no real title available?)
• scientific article; zbMATH DE number 3196255 (Why is no real title available?)
• Languages that Capture Complexity Classes
• Logic with the quantifier “there exist uncountably many”
• On a generalization of quantifiers
• On branching quantifiers in English
• On definability in dependence logic
• Some applications of Henkin quantifiers
• Some model theory for monotone quantifiers

Cited in

(12)

• Generalized quantifiers in dependence logic
• Dependence logic with generalized quantifiers: axiomatizations
• Dependence logic with a majority quantifier
• A double team semantics for generalized quantifiers
• Axiomatizing first-order consequences in dependence logic
• Axiomatizing first-order consequences in independence logic
• Correspondence and Completeness for Generalized Quantifiers
• Characterizing quantifier extensions of dependence logic
• Characterizing strongly first order dependencies: the non-jumping relativizable case
• Characterizing downwards closed, strongly first-order, relativizable dependencies
• On natural deduction in dependence logic
• COMPLETE LOGICS FOR ELEMENTARY TEAM PROPERTIES

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 Q2361348)