On the equivalence of two quantifier elimination tests

Simple item page
dc.creatorYin, Yimu
dc.date2007-02-13
dc.date.accessioned2026-07-07T07:46:41Z
dc.date.available2026-07-07T07:46:41Z
dc.descriptionWe prove that, for countable languages, two model-theoretic quantifier elimination tests, one proposed by J. R. Shoenfield and the other by L. van den Dries, are equivalent.
dc.identifierhttps://arxiv.org/abs/math/0702376
dc.identifierhttp://arxiv.org/abs/math/0702376
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/123911
dc.subjectLogic
dc.subject03C55
dc.titleOn the equivalence of two quantifier elimination tests
dc.typetext

Files

Collections

arXiv