On Some Properties of Positive and Strongly Positive Arithmetical Sets
Mathematical Problems of Computer Science · 2018
DOI: 10.51408/1963-0019 ↗Kurz gefasst
Fachartikel in der Zeitschrift Mathematical Problems of Computer Science, 2018. Verfasst von Seda Manukian. Die Arbeit nennt 8 Literaturangaben.
Abstract (Originalsprache)
The notions of positive and strongly positive arithmetical sets are defined as in [1]-[4] (see, for example, [2], p. 33). It is proved (Theorem 1) that any arithmetical set is positive if and only if it can be defined by an arithmetical formula containing only logical operations ∃, &,∨ and the elementary subformulas having the forms 𝑥𝑥=0 or 𝑥𝑥=𝑦𝑦+1, where 𝑥𝑥and 𝑦𝑦 are variables.Corollary:the logical description of the class of positive sets is obtained from the logical description of the class of strongly positive sets replacing the list of operations &,∨ by the list ∃, &,∨. It is proved (Theorem 2) that for any one-dimensional recursively enumerable set 𝑀𝑀 there exists 6- dimensional strongly positive set 𝐻𝐻 such that 𝑥𝑥 ∈𝑀𝑀 holds if and only if (1, 2𝑥𝑥, 0, 0, 1, 0)∈𝐻𝐻+, where 𝐻𝐻+ is the transitive closure of 𝐻𝐻.
Zitieren
APA
Manukian, S. (2018). On Some Properties of Positive and Strongly Positive Arithmetical Sets. Mathematical Problems of Computer Science. https://doi.org/10.51408/1963-0019
Vancouver
Manukian S. On Some Properties of Positive and Strongly Positive Arithmetical Sets. Mathematical Problems of Computer Science. 2018. doi:10.51408/1963-0019
BibTeX
@article{Manukian2018,
author = {Manukian, Seda},
title = {On Some Properties of Positive and Strongly Positive Arithmetical Sets},
journal = {Mathematical Problems of Computer Science},
year = {2018},
doi = {10.51408/1963-0019}
}
EUVIMED