Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Strong reducibility of partial numberings

  • Published:
Archive for Mathematical Logic Aims and scope Submit manuscript

Abstract.

A strong reducibility relation between partial numberings is introduced which is such that the reduction function transfers exactly the numbers which are indices under the numbering to be reduced into corresponding indices of the other numbering. The degrees of partial numberings of a given set with respect to this relation form an upper semilattice.

In addition, Ershov’s completion construction for total numberings is extended to the partial case: every partially numbered set can be embedded in a set which results from the given set by adding one point and which is enumerated by a total and complete numbering. As is shown, the degrees of complete numberings of the extended set also form an upper semilattice. Moreover, both semilattices are isomorphic.

This is not so in the case of the usual, weaker reducibility relation for partial numberings which allows the reduction function to transfer arbitrary numbers into indices.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Abramsky, S., Jung, A.: Domain theory. Handbook of Logic in Computer Science, Vol. 3, Semantic Structures, Clarendon Press, Oxford, 1994, pp. 1–168

  2. Badaev, S., Spreen, D.: A note on partial numberings. Math. Logic Quarterly. To appear

  3. Ershov, Yu.L.: Theorie der Numerierungen I. Zeitschr. f. math. Logik und Grundlagen d. Math. 19, 289–388 (1973)

    MATH  Google Scholar 

  4. Ershov, Yu.L.: Theorie der Numerierungen II. Zeitschr. f. math. Logik und Grundlagen d. Math. 21, 473–584 (1975)

    MATH  Google Scholar 

  5. Ershov, Yu.L.: Theorie der Numerierungen III. Zeitschr. f. math. Logik und Grundlagen d. Math. 23, 289–371 (1977)

    MATH  Google Scholar 

  6. Ershov, Yu.L.: Theory of Numberings. Nauka, Moscow, 1977 (in Russian)

  7. Ershov, Yu.L.: Theory of numberings. Handbook of Computability Theory, Elsevier, Amsterdam, 1999, pp. 473–503

  8. Gierz, G., et al.: Continuous Lattices and Domains, Cambridge University Press, 2003

  9. Spreen, D.: On some decision problems in programming. Inform. Computation 122, 120–139 (1995); Corrigendum 148, 241–244 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  10. Spreen, D.: On effective topological spaces. J. Symbolic Logic 63, 185–221 (1998); Corrigendum 65, 1917–1918 (2000)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Theoretische Informatik, Fachbereich Mathematik, Universität Siegen, 57068, Siegen, Germany

    Dieter Spreen

Authors
  1. Dieter Spreen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dieter Spreen.

Additional information

This research has partially been supported by INTAS under grant 00-499 “Computability in Hierarchies and Topological Spaces.”

Mathematics Subject Classification (2000): 03D45

Rights and permissions

Reprints and permissions

About this article

Cite this article

Spreen, D. Strong reducibility of partial numberings. Arch. Math. Logic 44, 209–217 (2005). https://doi.org/10.1007/s00153-004-0262-y

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00153-004-0262-y

Keywords

Search

Navigation