|
This article is cited in 1 scientific paper (total in 1 paper)
Mathematical logic, algebra and number theory
Limited-combinatorial sets
D. I. Ivanov, M. L. Platonov Tyumen State University, 6, Volodarskogo str., Tyumen, 625003, Russia
Abstract:
This article discusses the issue of classification of their own subsets of $\mathbb{N}=\{0,1,2,3,\ldots\}$ by means of partial Boolean functions. For an arbitrary partial Boolean function $\beta$ defines the notion of $\beta$-limited combinatorial set, which is a generalization of the concept of $\beta$-combinatorial set [1]. Fully describe the classes of these sets, the relationship between these classes by inclusion.
Keywords:
Boolean functions, combinatorial sets, combinatorial-selector sets, limited-combinatorial sets, a sequence of maximal restriction.
Received March 3, 2018, published October 28, 2019
Citation:
D. I. Ivanov, M. L. Platonov, “Limited-combinatorial sets”, Sib. Èlektron. Mat. Izv., 16 (2019), 1553–1560
Linking options:
https://www.mathnet.ru/eng/semr1147 https://www.mathnet.ru/eng/semr/v16/p1553
|
Statistics & downloads: |
Abstract page: | 233 | Full-text PDF : | 145 | References: | 16 |
|