Correspondence and Completeness for Generalized Quantifiers

DOI10.1093/JIGPAL/3.2-3.167MaRDI QIDQ4842271zbMATH OpenOpenAlexFDO

Authors Natasha Alechina, Michiel van Lambalgen

Publication date 24 July 1996

Published in Logic Journal of the IGPL (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/792c32fdb747a548affd01c4da11252db0e38462

zbMATH Keywords

completenessextensionalitygeneralized quantifierrelational modelsSahlqvist theoremfirst order conditionsimplicit dependencies between variables

Mathematics Subject Classification ID

Logic with extra quantifiers and operators (03C80)

Recommendations

• Dependence logic with generalized quantifiers: axiomatizations
• Dependence logic with generalized quantifiers: axiomatizations
• Generalized quantifiers and modal logic
• Quantifiers determined by partial orderings
• Generalized quantification as substructural logic

Cited in

(7)

• Modal languages and bounded fragments of predicate logic
• On a decidable generalized quantifier logic corresponding to a decidable fragment of first-order logic
• Dependence logic with generalized quantifiers: axiomatizations
• Completeness and interpolation of almost-everywhere quantification over finitely additive measures
• Generalized quantification as substructural logic
• Dependence logic with generalized quantifiers: axiomatizations
• Functional Completeness in CPL via Correspondence Analysis

This page was built for publication: Correspondence and Completeness for Generalized Quantifiers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4842271)