Ramsey theory is needed for solving definability problems of generalized quantifiers

DOI10.1007/3-540-46583-9_6MaRDI QIDQ4955354zbMATH OpenFDO

Authors Kerkko Luosto

Publication date 1 May 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-46583-9_6

zbMATH Keywords

generalized quantifiersquantifier definabilityRamsey theory

Mathematics Subject Classification ID

Model theory of finite structures (03C13) Logic with extra quantifiers and operators (03C80) Ramsey theory (05D10)

Recommendations

• Definable Ramsey and definable Erdös ordinals
• Ramsey theory on generalized Baire space
• Ramsey's Theorem and the Pigeonhole Principle in Intuitionistic Mathematics
• Ramsey theorem as an intuitionistic property of well founded relations
• scientific article; zbMATH DE number 512985
• A dichotomy result for Ramsey quantifiers
• Ramsey theorem for pairs as a classical principle in intuitionistic arithmetic
• A refinement of the Ramsey hierarchy via indescribability
• Ramsey-Turán theory
• Using Ultrafilters to Prove Ramsey-type Theorems

Cited in

(1)

• On the expressive power of monotone natural language quantifiers over finite models

This page was built for publication: Ramsey theory is needed for solving definability problems of generalized quantifiers

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