Skip to main content
SpringerLink
Log in

Perfect Local Computability of Superatomic Boolean Algebras

  • Published:
Journal of Mathematical Sciences Aims and scope Submit manuscript

We prove that a superatomic Boolean algebra is perfectly locally computable if and only if its rank is a computable ordinal. Bibliography: 7 titles.

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

Access this article

Log in via an institution

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. S. S. Goncharov and Yu. L. Ershov, Constructive Models, Kluwer Academic/Plenum Press, New York (2002).

    Google Scholar 

  2. R. Miller and D. Mulcahey, “Perfect local computability and computable simulations,” Lect. Notes Comput. Sci. 5028, 447–456 (2008).

    Article  MathSciNet  Google Scholar 

  3. R. Miller, “Locally computable structures,” Lect. Notes Comput. Sci. 4497, 575–584 (2007).

    Article  Google Scholar 

  4. S. S. Goncharov, “Constructivizability of superatomic Boolean algebras” [in Russian], Algebra Logika 12, No. 1, 31–40 (1973).

  5. S. S. Goncharov, Countable Boolean Algebras and Decidability, Kluwer Academic/Plenum Publishers, New York (1997).

    MATH  Google Scholar 

  6. H. Rogers, Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York (1967).

    MATH  Google Scholar 

  7. G. E. Sacks, Higher Recursion Theory Springer, Berlin etc. (1990).

Download references

Author information

Authors and Affiliations

  1. Sobolev Institute of Mathematics, SB RAS 4, pr. Akad. Koptyuga, Novosibirsk, 630090, Russia

    D. A. Luppov

Authors
  1. D. A. Luppov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to D. A. Luppov.

Additional information

Translated from Vestnik Novosibirskogo Gosudarstvennogo Universiteta: Seriya Matematika, Mekhanika, Informatika 14, No. 2, 2014, pp. 24-41.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Luppov, D.A. Perfect Local Computability of Superatomic Boolean Algebras. J Math Sci 211, 789–804 (2015). https://doi.org/10.1007/s10958-015-2634-8

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10958-015-2634-8

Keywords

Search

Navigation