On quantification with a finite universe
逻辑
2016-09-07 v1 计算复杂性
计算机科学中的逻辑
摘要
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.
引用
@article{arxiv.math/9809201,
title = {On quantification with a finite universe},
author = {Saharon Shelah},
journal= {arXiv preprint arXiv:math/9809201},
year = {2016}
}