Definability of polyadic lifts of generalized quantifiers

DOI10.1023/A:1008215718090MaRDI QIDQ1361405zbMATHFDO

Authors Lauri Hella, Jouko Väänänen, Dag Westerståhl

Publication date 28 January 1998

Published in Journal of Logic, Language and Information (Search for Journal in Brave)

zbMATH Keywords

branchingdefinabilitygeneralized quantifierrelativizationfinite models[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Ehrenfeucht-Fra%EF%BF%BD%EF%BF%BDss%EF%BF%BD%EF%BF%BD+game&go=Go Ehrenfeucht-Fra��ss�� game]monotone quantifierpolyadic liftspolyadic quantifiersRamseyficationresumption

Mathematics Subject Classification ID

Model theory of finite structures (03C13) Logic with extra quantifiers and operators (03C80) Interpolation, preservation, definability (03C40)

Recommendations

• Unary quantifiers on finite models
• Polyadic quantifiers
• Definability of second order generalized quantifiers
• Characterizing definability of second-order generalized quantifiers

Cited in

(9)

• Relational structures constructible by quantifier free definable operations
• The Computational Complexity of Quantified Reciprocals
• Characterizing polynomial Ramsey quantifiers
• A dichotomy result for Ramsey quantifiers
• A remark on collective quantification
• Polyadic quantifiers
• Dependence logic with generalized quantifiers: axiomatizations
• Characterizing definability of second-order generalized quantifiers
• Definability hierarchies of generalized quantifiers

This page was built for publication: Definability of polyadic lifts of generalized quantifiers

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