Skip to main content
Log in

Presburgerness of predicates regular in two number systems

  • Published:
Siberian Mathematical Journal Aims and scope Submit manuscript

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

Access this article

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

Instant access to the full article PDF.

Institutional subscriptions

Literature Cited

  1. A. L. Semenov, “Presburgerness of sets recognizable by finite automata in two number systems,” Third All-Union Conference of Mathematical Logic. Reports Abstracts [in Russian], Izd. Inst. Math. Sib. Otdel. Akad. Nauk SSSR, Novosibirsk (1974), pp. 201–203.

    Google Scholar 

  2. J. R. Büchi, “Weak second-order arithmetic and finite automata,” Z. Math. Logik Grundl. Math.,6, No. 1, 66–92 (1960); Kiberneticheskii Sb., No. 8, 42–77 (1964).

    Google Scholar 

  3. A. Cobham, “On the base-dependence of sets of numbers, recognizable by finite automata,” Math. Systems Theory,3, No. 2, 186–192 (1969); Kiberneticheskii Sb., Nov. Ser., No. 8, 62–71 (1971).

    Google Scholar 

  4. S. Ginsburg and E. H. Spanier, “Semigroups, Presburger formulas and languages,” Pac. J. Math.,13, No. 4, 570–581 (1966).

    Google Scholar 

  5. J. W. Thatcher, “Decision problems for multiple successor arithmetics,” J. Symbolic Logic,31, No. 2, 182–190 (1966).

    Google Scholar 

Download references

Authors

Additional information

Translated from Sibirskii Matematicheskii Zhurnal, Vol. 18, No. 2, pp. 403–418, March–April, 1977.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Semenov, A.L. Presburgerness of predicates regular in two number systems. Sib Math J 18, 289–300 (1977). https://doi.org/10.1007/BF00967164

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation