# On Transitive Closures of Two-dimensional Strongly Positive Arithmetical Sets

## Keywords:

Positive, Strongly positive, Arithmetical set, Dimension, Signature## References

S. N. Manukian, “On the representation of recursively enumerable sets in weak arithmetics”, Transactions of the IIAP of NAS of RA, Mathematical Problems of Computer Science, vol. 27, pp. 90-110, 2006.

S. N. Manukian, “On an Algebraic Classification of Multidimensional Recursively Enumerable Sets Expressible in Formal Arithmetical Systems”, Transactions of the IIAP of NAS of RA, Mathematical Problems of Computer Science, vol. 41, pp. 103-113, 20014.

S. N.Manukian, “On strongly positive multidimensional arithmetical sets”, Transactions of the IIAP of NAS of RA, Mathematical Problems of Computer Science, vol. 43, pp. 32- 41, 2015.

S. C. Kleene, Introduction to Metamathematics, D.Van Nostrand Comp., Inc., New York – Toronto, 1952.

E. Mendelson, Introduction to Mathematical Logic, D.Van Nostrand Comp., Inc., Princeton – Toronto – New York – London, 1964.

H. B. Enderton, A Mathematical Introduction to Logic, 2nd edition, San Diego, Harcourt, Academic Press, 2001.

G. S. Tseytin, “One method of representation for the theory of algorithms and enumerable sets”, Transactions of Steklov Institute of the Acad. Sci. USSR (in Russian), vol. 72, pp. 69- 98, 1964.

A. I. Maltsev, Algorithms and Recursive Functions, 2nd edition (in Russian), M.,”Nauka”, 1986.

## Downloads

## Published

## How to Cite

*Mathematical Problems of Computer Science*,

*45*, 67–76. Retrieved from http://mpcs.sci.am/index.php/mpcs/article/view/169

## Issue

## Section

## License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.