Skip to main content
SpringerLink
Log in

Generatability of admissible sets

  • Published:
Algebra and Logic Aims and scope

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

Literature cited

  1. J. Barwise, Admissible Sets and Structures, Springer, Berlin (1975).

    Google Scholar 

  2. Yu. L. Ershov, "Dynamical logic over admissible sets," Dokl. Akad. Nauk SSSR,27, No. 5, 1045–1048 (1983).

    Google Scholar 

  3. Yu. L. Ershov, "Σ-definability in admissible sets," Dokl. Akad. Nauk SSSR,285, No. 4, 792–795 (1985).

    Google Scholar 

  4. Yu. L. Ershov, "The language of Σ-expressions," Vychisl. Systemy, No. 114, 3–10, 1986.

  5. Yu. L. Ershov, "Σ-admissible sets," Vychisl. Systemy, No. 114, 35–39, 1986.

  6. V. Yu. Sazonov and D. I. Sviridenko, "Denotational semantics of the language of Σ-expressions," Vychisl. Systemy, No. 114, 16–34 (1986).

Download references

Authors
  1. Yu. L. Ershov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Algebra i Logika, Vol. 26, No. 5, pp. 577–596, September–October, 1987.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ershov, Y.L. Generatability of admissible sets. Algebra and Logic 26, 346–361 (1987). https://doi.org/10.1007/BF01978691

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01978691

Keywords

Search

Navigation