Polish group actions and admissible sets

dc.creatorMajcher-Iwanow, B.
dc.date2007-01-27
dc.date2008-02-28
dc.date.accessioned2026-07-07T09:23:39Z
dc.date.available2026-07-07T09:23:39Z
dc.descriptionWe define some coding of Borel sets in admissible sets. Using this we generalize certain results from model theory involving admissible sets to the case of continuous actions of closed permutation groups on Polish spaces. In particular we obtain counterparts of Nadel's theorems about relationships between Scott sentences and admissible sets.
dc.description34 pages, LaTeX
dc.identifierhttps://arxiv.org/abs/math/0701788
dc.identifierhttp://arxiv.org/abs/math/0701788
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/155808
dc.subjectLogic
dc.subject03E15 (Primary) 03C70 (Secondary)
dc.titlePolish group actions and admissible sets
dc.typetext

Files

Collections