Skip to main content
SpringerLink
Log in

Construction of decidable singular theories of two successor functions with an extra predicate

  • 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. M. O. Rabin, "Definability of second-order theories and automata on infinite trees," Trans. Am. Math. Soc.,141, 1–35 (1969).

    Google Scholar 

  2. A. I. Kokorin and A. G. Pinus, "Decidability problems for extended theories," Usp. Mat. Nauk,33, No. 2, 49–84 (1978).

    Google Scholar 

  3. J. R. Büchi, "On a decision method in restricted second-order arithmetic," Proc. Int. Congr. Logic, Methodol. and Philos. Sci., 1960, Stanford Univ. Press (1962), pp. 1–11.

  4. C. C. Elgot and M. O. Rabin, "Decidability and undecidability of extensions of second (first)-order theory of (generalized) successors," J. Symb. Logic,31, No. 2, 169–181 (1966).

    Google Scholar 

  5. D. Siefkes, "Decidable extensions of monadic second-order successor arithmetic," Ber. Math. Forschungsinst. Oberwolfach,3, 441–472 (1970).

    Google Scholar 

  6. D. Siefkes, "Decidable and undecidable extensions of one-place second-order arithmetic," J. Symb. Logic,33, No. 3, 494–495 (1968).

    Google Scholar 

  7. W. Thomas, "The theory of successors with an extra predicate," Math. Ann.,237, No. 2, 121–132 (1978).

    Google Scholar 

  8. A. A. Semenov, "Logical theories of one-place functions on the natural series," Izv. Akad. Nauk SSSR, Ser. Mat.,47, No. 3, 623–658 (1983).

    Google Scholar 

  9. Ya. M. Barzdin', "The complexity of recognizing symmetry on Turing machines," Probl. Kibern.,15, Nauka, Moscow (1965), pp. 245–248.

    Google Scholar 

  10. B. A. Trakhtenbrot, "Turing computations with logarithmic retardation," Algebra Logika,3, No. 4, 33–48 (1964).

    Google Scholar 

  11. A. A. Letichevskii, "The equivalence of automata with respect to semigroups," in: Theoretical Cybernetics [in Russian], Vol. 6, Kiev (1970), pp. 3–71.

    Google Scholar 

  12. L. P. Lisovik, "Finite transformers over graduated trees and quasiidentities in a free semigroup," Probl. Kibern.,40, Nauka, Moscow (1983), pp. 19–41.

    Google Scholar 

Download references

Authors
  1. L. P. Lisovik
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Algebra i Logika, Vol. 23, No. 3, pp. 266–277, May–June, 1984.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lisovik, L.P. Construction of decidable singular theories of two successor functions with an extra predicate. Algebra and Logic 23, 181–189 (1984). https://doi.org/10.1007/BF01979864

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation