On hierarchies of universal predicates

Simple item page
dc.creatorHrubes, Pavel
dc.date2007-03-24
dc.date.accessioned2026-07-07T07:53:52Z
dc.date.available2026-07-07T07:53:52Z
dc.descriptionWe investigate a hierarchy of arithmetical structures obtained by a transfinite addition of a canonic universal predicate, where the canonic universal predicate for M is defined as a minimum universal predicate for M in terms of definability. We determine the upper bound of the hierarchy and give a characterisation for the sets definable in the hierarchy.
dc.identifierhttps://arxiv.org/abs/math/0703720
dc.identifierhttp://arxiv.org/abs/math/0703720
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/126385
dc.subjectLogic
dc.titleOn hierarchies of universal predicates
dc.typetext

Files

Collections

arXiv