Skip to main content
SpringerLink
Log in

On the Problem of Finite Signature

  • Published:
Siberian Mathematical Journal Aims and scope Submit manuscript

Abstract

We show that not each model can be replaced by a model of finite signature so that its automorphism group remains the same.

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. Ershov Yu. L. and Goncharov S. S., Constructive Models, Kluwer Academic / Plenum Publishers, New York etc. (2000) (Siberian School of Algebra and Logic).

    Google Scholar 

  2. Rogers H., Theory of Recursive Functions and Effective Computability, McGraw-Hill Book Comp., New York; St. Louis; San Francisco; Toronto; London; Sydney (1967).

    Google Scholar 

  3. Morozov A. S., “Computable automorphisms of models,” in: Abstracts: Mathematisches Forschungsinstitut Oberwolfach Tagungsbericht 3/2001, Berechenbarkeitstheorie 21.01.-27.01.2001, Oberwolfach, 2001, pp. 6–7.

Download references

Author information

Authors and Affiliations

  1. Sobolev Institute of Mathematics, Novosibirsk

    A. S. Morozov

Authors
  1. A. S. Morozov
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Morozov, A.S. On the Problem of Finite Signature. Siberian Mathematical Journal 44, 170–173 (2003). https://doi.org/10.1023/A:1022032908561

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1022032908561

Search

Navigation