4 found
Dimiter Skordev [4]Dimiter G. Skordev [1]
See also
Dimiter Skordev
Sofia University
  1.  32
    Conditional Computability of Real Functions with Respect to a Class of Operators.Ivan Georgiev & Dimiter Skordev - 2013 - Annals of Pure and Applied Logic 164 (5):550-565.
    For any class of operators which transform unary total functions in the set of natural numbers into functions of the same kind, we define what it means for a real function to be uniformly computable or conditionally computable with respect to this class. These two computability notions are natural generalizations of certain notions introduced in a previous paper co-authored by Andreas Weiermann and in another previous paper by the same authors, respectively. Under certain weak assumptions about the class in question, (...)
    Direct download (6 more)  
    Export citation  
    Bookmark   1 citation  
  2.  8
    Computability of Real Numbers by Using a Given Class of Functions in the Set of the Natural Numbers.Dimiter Skordev - 2002 - Mathematical Logic Quarterly 48 (S1):91-106.
    Given a class ℱ oft otal functions in the set oft he natural numbers, one could study the real numbers that have arbitrarily close rational approximations explicitly expressible by means of functions from ℱ. We do this for classes ℱsatisfying certain closedness conditions. The conditions in question are satisfied for example by the class of all recursive functions, by the class of the primitive recursive ones, by any of the Grzegorczyk classes ℰnwith n ≥ 2, by the class of all (...)
    Direct download (4 more)  
    Export citation  
    Bookmark   2 citations  
  3.  23
    On a Modal-Type Language for the Predicate Calculus.Dimiter Skordev - 1984 - Bulletin of the Section of Logic 13 (3):111-116.
    In order to avoid the use of individual variables in predicate calculus, several authors proposed language whose expressions can be interpreted, in general, as denotations of predicates . The present author also proposed a language of this kind [5]. The absence of individual variables makes all these languages rather different from the traditional language of predicate calculus and from the usual language of mathematics. The translation procedures from the ordinary predicate languages into the predicate languages without individual variables and vice (...)
    Direct download  
    Export citation  
  4.  15
    Some Subrecursive Versions of Grzegorczyk's Uniformity Theorem.Dimiter Skordev - 2004 - Mathematical Logic Quarterly 50 (45):520-524.
    A theorem published by A. Grzegorczyk in 1955 states a certain kind of effective uniform continuity of computable functionals whose values are natural numbers and whose arguments range over the total functions in the set of the natural numbers and over the natural numbers. Namely, for any such functional a computable functional with one function-argument and the same number-arguments exists such that the values of the first of the functionals at functions dominated by a given one are completely determined by (...)
    Direct download (2 more)  
    Export citation  
    Bookmark   1 citation