On quantification with a finite universe
Logic
2016-09-07 v1 Computational Complexity
Logic in Computer Science
Abstract
We consider a finite universe U (more exactly - a family U of them) and second order quantifiers Q_K, 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.
Keywords
Cite
@article{arxiv.math/9809201,
title = {On quantification with a finite universe},
author = {Saharon Shelah},
journal= {arXiv preprint arXiv:math/9809201},
year = {2016}
}