On Inner Constructivizability of Admissible Sets ⋆ Alexey Stukachev Sobolev Institute of Mathematics, Novosibirsk, Russia aistu@math.nsc.ru Abstract. We consider a problem of inner constructivizability of admis- sible sets by means of elements of a bounded rank. For hereditary finite superstructures we find a precise estimates for the rank of inner construc- tivizability: it is equal to ω for superstructures over finite structures and less or equal to 2 otherwise. We introduce examples of hereditary fi- nite superstructures with ranks 0, 1, 2. It is shown that hereditary finite superstructure over field of real numbers has rank 1. Notations and terminology used below are standard and corresponds to [1, 2]. We denote the domains of a structure M and KPU-model A by M and A re- spectively. Further on, without loss of generality we will consider only structures and KPU-models with predicate signatures. Let M be a structure of computable predicate signature 〈P n 0 0 ,...,P n k k ,...〉, and let A be a KPU-model, i.e. a structure of signature containing symbols U 1 , ∈ 2 , which is a model of the system of axioms KPU. Following [1], M is called Σ-definable (constructivizable) in A if there exists a computable sequence of Σ-formulas Φ(x 0 ,y),Ψ (x 0 ,x 1 ,y),Ψ ∗ (x 0 ,x 1 ,y),Φ 0 (x 0 ,...,x n 0 −1 ,y), Φ ∗ 0 (x 0 ,...,x n 0 −1 ,y),...,Φ k (x 0 ,...,x n k −1 ,y),Φ ∗ k (x 0 ,...,x n k −1 ,y),... such that for some parameter a ∈ A, and letting M 0 ⇌ Φ A (x 0 ,a), η ⇌ Ψ A (x 0 ,x 1 ,a) ∩ M 2 0 one has that M 0 = ∅ and η is a congruence relation on the structure M 0 ⇌ 〈M 0 ,P M 0 0 ,...,P M 0 k ,...〉, where P M 0 k ⇌ Φ A k (x 0 ,...,x n k −1 ) ∩ M n k 0 ,k ∈ ω, Ψ ∗A (x 0 ,x 1 ,a) ∩ M 2 0 = M 2 0 \ Ψ A (x 0 ,x 1 ,a), ⋆ This work was supported by the INTAS YSF (grant 04-83-3310), the Program ”Uni- versities of Russia” (grant UR.04.01.488), the Russian Foundation for Basic Research (grant 05-01-00481a) and the Grant of the President of RF for Young Scientists (grant MK.1239.2005.1).