RUS  ENG
Full version
JOURNALS // Sibirskie Èlektronnye Matematicheskie Izvestiya [Siberian Electronic Mathematical Reports] // Archive

Sib. Èlektron. Mat. Izv., 2019 Volume 16, Pages 1553–1560 (Mi semr1147)

This article is cited 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.

UDC: 510.5

MSC: 03D99

Received March 3, 2018, published October 28, 2019

DOI: 10.33048/semi.2019.16.106



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025