Access the full text.
Sign up today, get DeepDyve free for 14 days.
References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.
-- For an rc-place Boolean function , we define a class () of weakly -implicatively selective sets, which are subsets of the set of natural numbers. The dimension of the class () is the number of essential variables of the function . We describe, up to inclusion, all classes () of dimension 2 and 3, excepting one case. This paper can be considered as a continuation of the paper [1] and is close to papers [2, 3]. Let A C = {0. 1,2, . . . } and be an rc-place Boolean function without fictitious variables. For G N, we set = 1 if and je = 0 otherwise. A set A is called weakly -implicatively selective ( -IS) set if there exists an rc-place partial recursive function / such that (V*!,... , We say that / corresponds to A. We set K (ft) = {A C N: A is a -IS set}, and the number n will be referred to as the dimension of the class A Boolean function is admissible if (0, . . . ,0) = 0. It is clear that if is not admissible, then (ft) -- {N}, and this case is of no
Discrete Mathematics and Applications – de Gruyter
Published: Jan 1, 1999
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.