On Quantification with A Finite Universe

We consider a finite universe U (more exactly - a family U of them), second order quantifiers QK , where for each U this means quantifying over a family of n(K)-place relations closed under permuting U. We define some natural orders and shed some light on the classification problem of those quantifiers. I would like to thank Alice Leonhardt for the beautiful typing. Publication No. 639 First Typed - 97/Dec/19 Latest Revision - 98/Oct/27 Typeset by AMS-TEX 1 

• Type: Journal
• Year: 2000
• Where: JSYML
• Authors: Saharon Shelah
• Keywords: Classification Problem, JSYML 2000, Natural Orders, Order Quantifiers