Local structure of Rogers semilattices of Σn 0-computable numberings

Article Properties
Refrences
Title Journal Journal Categories Citations Publication Date
10.1023/A:1012516217265 2001
10.1007/BF02671553 1997
10.1007/BF01673573 1978
10.1007/BF02218612 1972
S. Yu. Podzorov, “Initial segments in Rogers semilattices of Σn 0-computable numberings, ” Algebra Logika, 42, No.2, 211–225 (2003). 2003
Refrences Analysis
Refrences used by this article by year
Citations
Title Journal Journal Categories Citations Publication Date
Some properties of classes of minimal numberings of arithmetical set families

Mathematics and Theoretical Computer Science 2024
Fixed point theorems for minimal numberings

Journal of Logic and Computation
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Science: Mathematics
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
1 2023
Positive Reducibilities, Extreme Numberings, and Completeness Siberian Advances in Mathematics 2023
Two Theorems on Minimal Generalized Computable Numberings Moscow University Mathematics Bulletin
  • Science: Mathematics
2023
Minimal Generalized Computable Numberings and Families of Positive Preorders Algebra and Logic
  • Science: Mathematics
  • Science: Mathematics
2022
Citations Analysis
The category Science: Mathematics 8 is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled On the definition of a Lachlan semilattice and was published in 2006. The most recent citation comes from a 2024 study titled Some properties of classes of minimal numberings of arithmetical set families. This article reached its peak citation in 2023, with 3 citations. It has been cited in 7 different journals. Among related journals, the Algebra and Logic cited this research the most, with 3 citations. The chart below illustrates the annual citation trends for this article.
Citations used this article by year