# On Some Properties of Positive and Strongly Positive Arithmetical Sets

## DOI:

https://doi.org/10.51408/1963-0019## Keywords:

Positive set, Strongly positive set, Transitive closure, Signature## References

S. N. Manukian, “On an algebraic classification of multidimensional recursively enumerable sets expressible in formal arithmetical systems”, Transactions of the IIAP of NAS RA, Mathematical Problems of Computer Science, vol. 41, pp. 103-113, 2014.

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

S. N. Manukian, “On transitive closures of two-dimensional strongly positive arithmetical sets”, Transactions of the IIAP of NAS RA, Mathematical Problems of Computer Science, vol. 45, pp. 67-76, 2016.

S. N. Manukian, “On the structure of positive and strongly positive arithmetical sets”, Proceedings of the International Conference and Information Technologies, CSIT-17, Yerevan, Armenia, p. 33, 2017.

S. C. Kleene, Introduction to Metamathematics, D. van Nostrand comp., Inc. New York-Toronto, 1952.

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

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

M. L. Minsky, “Recursive Unsolvability of Post’s Problem of “Tag and Other Topics in Theory of Turing Machines”, Ann. Math., vol. 74, pp. 437-455, 1961.

## Downloads

## Published

## How to Cite

*Mathematical Problems of Computer Science*,

*50*, 52–55. https://doi.org/10.51408/1963-0019

## Issue

## Section

## License

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