Skip to main content
SpringerLink
Log in

Recursive Terms in Semantic Programming

  • Published:
Siberian Mathematical Journal Aims and scope Submit manuscript

Abstract

For constructing an enrichment of a language with restricted quantifiers, we extend the notion of term by the construction of the terms conditional and recursive with respect to lists. We show that the so-obtained extension of the language of formulas with restricted quantifiers over structures with hereditary finite lists is a conservative enrichment and the new terms are Δ-definable in the basic language.

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. Goncharov S. S., “Conditional terms in semantic programming,” Sib. Math. J., vol. 58, No. 5, 794–800 (2017).

    Article  MathSciNet  MATH  Google Scholar 

  2. Goncharov S. S. and Sviridenko D. I., “Σ-Programming,” Trans. Amer. Math. Soc., no. 142, 101–121 (1989).

    MATH  Google Scholar 

  3. Goncharov S. S. and Sviridenko D. I., “Σ-Programming and their semantics,” Vychisl. Systemy, no. 120, 24–51 (1987).

    MATH  Google Scholar 

  4. Goncharov S. S. and Sviridenko D. I., “Theoretical aspects of Σ-programming,” Lect. Notes Comput. Sci., vol. 215, 169–179 (1986).

    Article  Google Scholar 

  5. Ershov Yu. L., Goncharov S. S., and Sviridenko D. I., “Semantic programming,” in: Information Processing 86. Proc. IFIP 10th World Comput. Congress, Dublin, 1986, vol. 31, 1113–1120.

    MATH  Google Scholar 

  6. Goncharov S. S. and Sviridenko D. I., “Mathematical bases of semantic programming,” Soviet Math. Dokl., vol. 31, No. 6, 608–610 (1986).

    MATH  Google Scholar 

  7. Ershov Yu. L., Goncharov S. S., and Sviridenko D. I., “Semantic foundations of programming,” Lect. Notes Comput. Sci., vol. 278, 116–122 (1987).

    Article  MATH  Google Scholar 

  8. Ershov Yu. L., “The principle of Σ-enumeration,” Soviet Math. Dokl., vol. 27, No. 4, 670–672 (1983).

    MATH  Google Scholar 

  9. Ershov Yu. L., “Dynamic logic over admissible sets,” Soviet Math. Dokl., vol. 28, No. 5, 739–742 (1983).

    MathSciNet  MATH  Google Scholar 

  10. Ershov Yu. L., Definability and Computability, Consultants Bureau, New York and London (1996).

    MATH  Google Scholar 

  11. Goncharov S. S., “The theory of lists, and its models,” Vychisl. Systemy, no. 114, 84–95 (1986).

    MathSciNet  MATH  Google Scholar 

  12. Goncharov S. S., “Data models and languages for their description,” Trans. Amer. Math. Soc., no. 143, 139–152 (1989).

    MATH  Google Scholar 

  13. Ershov Yu. L., Goncharov S. S., Nerode A., and Remmel J., Introduction to the Handbook of Recursive Mathematics. Vol. 138, Elsevier, Amsterdam (1998).

    MATH  Google Scholar 

  14. Ershov Yu. L., Puzarenko V. G., and Stukachev A. I., “HF-computability,” in: Computability in Context, Imperial College Press, London, 2011, 169–242.

    Chapter  Google Scholar 

  15. Morozov A. S. and Puzarenko V. G., “Σ-subsets of natural numbers,” Algebra and Logic, vol. 43, No. 3, 162–178 (2004).

    Article  MathSciNet  Google Scholar 

  16. Ospichev S. and Ponomarev D., “A note on the complexity of formulas in semantic programming,” Sib. Elektron. Mat. Izv., 2018, vol. 15, 987–995.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sobolev Institute of Mathematics, Novosibirsk, Russia

    S. S. Goncharov & D. I. Sviridenko

Authors
  1. S. S. Goncharov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. I. Sviridenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to S. S. Goncharov.

Additional information

Original Russian Text © 2018 Goncharov S.S. and Sviridenko D.I.

__________

Novosibirsk. Translated from Sibirskii Matematicheskii Zhurnal, vol. 59, no. 6, pp. 1279–1290, November–December, 2018; DOI: 10.17377/smzh.2018.59.605.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Goncharov, S.S., Sviridenko, D.I. Recursive Terms in Semantic Programming. Sib Math J 59, 1014–1023 (2018). https://doi.org/10.1134/S0037446618060058

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0037446618060058

Keywords

Search

Navigation