A dichotomy in classifying quantifiers for finite models
| dc.creator | Doron, Mor | |
| dc.creator | Shelah, Saharon | |
| dc.date | 2004-05-06 | |
| dc.date.accessioned | 2026-07-07T05:07:57Z | |
| dc.date.available | 2026-07-07T05:07:57Z | |
| dc.description | We consider a family U of finite universes. The second order quantifier Q_R, means for each u in U quantifying over a set of n(R)-place relations isomorphic to a given relation. We define a natural partial order on such quantifiers called interpretability. We show that for every Q_R, ever Q_R is interpretable by quantifying over subsets of u and one to one functions on u both of bounded order, or the logic L(Q_R) (first order logic plus the quantifier Q_R) is undecidable. | |
| dc.identifier | https://arxiv.org/abs/math/0405091 | |
| dc.identifier | http://arxiv.org/abs/math/0405091 | |
| dc.identifier | J. Symbolic Logic 70 No. 4 (2005) 1297--1324 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/71069 | |
| dc.subject | Logic | |
| dc.title | A dichotomy in classifying quantifiers for finite models | |
| dc.type | text |