Dimiter Skordev | Academic Influence

Dimiter Skordev's AcademicInfluence.com Rankings

Dimiter Skordev

Mathematics

#5515

World Rank

#7750

Historical Rank

Group Theory

#597

World Rank

#709

Historical Rank

Number Theory

#575

World Rank

#714

Historical Rank

Algebra

#749

World Rank

#976

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Dimiter Skordev's Degrees

PhD Mathematics Sofia University
Masters Mathematics Sofia University
Bachelors Mathematics Sofia University

Similar Degrees You Can Earn

Best Online Bachelor's in Math 2025

Why Is Dimiter Skordev Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Dimiter Skordev is a professor in the Department of Mathematical Logic and Applications, Faculty of Mathematics and Computer Science at the University of Sofia. Chairman of the department in 1972-2000. Doyen and pioneer of mathematical logic research in Bulgaria who developed a Bulgarian school in the theory of computability, namely the algebraic recursion theory. He was the 1981 winner of Acad. Nikola Obreshkov Prize, the highest Bulgarian award in mathematics, bestowed for his monograph Combinatory Spaces and Recursiveness in Them.

(See a Problem?)

Dimiter Skordev's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Mathematical Logic and Its Applications (2011) (19)
Computability of Real Numbers by Using a Given Class of Functions in the Set of the Natural Numbers (2002) (15)
M2-computable real numbers (2012) (10)
Characterization of the Computable Real Numbers by Means of Primitive Recursive Functions (2000) (9)
An Abstract Approach to Some Loop Detection Problems (1997) (9)
On the Subrecursive Computability of Several Famous Constants (2008) (8)
E 2-computability of e , π and other famous constants (2007) (4)
On Some Computability Notions for Real Functions (2013) (4)
Short Note: On Van Gelder's Loop Detection Algorithm (1992) (4)
The First Recursion Theorem for Iterative Combinatory Spaces (1979) (3)
Some subrecursive versions of Grzegorczyk's Uniformity Theorem (2004) (3)
A Subrecursive Refinement of the Fundamental Theorem of Algebra (2006) (3)
On the detection of some periodic loops during the execution of Prolog programs (1993) (3)
On a Relative Computability Notion for Real Functions (2011) (3)
Conditional computability of real functions with respect to a class of operators (2012) (2)
Approximation systems for functions in topological and in metric spaces (2013) (2)
e2-computability of e, pi and Other Famous Constants (2008) (2)
An epsilon-delta characterization of a certain TTE computability notion (2012) (2)
Moschovakis Extension of Represented Spaces (2018) (1)
An Impossible Difference Condition: 11074 (2006) (1)
On the Computer Proof of a Result in the Abstract Theory of Segments (2007) (1)
The New National Standard for the Romanization of Bulgarian1 (2011) (1)
Some models of combinatory logic (1976) (1)
A SIMPLE CHARACTERIZATION OF THE COMPUTABILITY OF REAL FUNCTIONS (2018) (0)
A Normal form Theorem for Recursive Operators in Iterative Combinatory Spaces (1978) (0)
An algebraic treatment of flow diagrams and its application to generalized recursion theory (1982) (0)
Short summaries (2009) (0)
Some models for the weak theory of combinators are described. These models consist of partial functions having natural number arguments and natural number values. The role of the application operation is played by certain t~-recursive operators. (1976) (0)
Moschovakis extension of multi-represented spaces (2018) (0)
Embedding of iterative post algebras in a semigroup (1982) (0)
On multi-valued homomorphisms (1984) (0)
Some theorems on passing from local to global presence of properties of functions (2016) (0)
Computability in Iterative Combinatory Spaces (1992) (0)
Ivan Soskov: A Life in Computability (2017) (0)
On a class of bases for boolean functions (2009) (0)
LOOP DETECTION IN PROLOG BY SEARCHING FOR PRIMITIVE CYCLIC GOALS (2011) (0)
Some Aspects of Distancing (2022) (0)
Computational Structures and Computability on Them (1992) (0)
ON A MODAL-TYPE LANGUAGE FOR THE PREDICATE CALCULUS (2008) (0)
On the use of homomorphisms for proving the equivalence of some programs (1988) (0)

This paper list is powered by the following services:

Other Resources About Dimiter Skordev

en.wikipedia.org

What Schools Are Affiliated With Dimiter Skordev?

Dimiter Skordev is affiliated with the following schools:

Image Attributions

Image Source for Dimiter Skordev