ɡˈɪvən ðə bˈuːliən dəmˈeɪn bˈiː ˈiːkwəlz zˈiəɹoʊ,wˈʌn, ɐ sˈɛt ˈɛf ʌv bˈuːliən fˈʌŋkʃənz fˈaɪ: bˌiːˌɛnˈaɪ ɹˈaɪt bˈiː ɪz fˈʌŋkʃənəli kəmplˈiːt ɪf ðə klˈoʊn ˌɔn bˈiː dʒˈɛnɚɹˌeɪɾᵻd baɪ ðə bˈeɪsɪk fˈʌŋkʃənz fˈaɪ kəntˈeɪnz ˈɔːl fˈʌŋkʃənz lˌɛɾɚwˈʌnnˈaɪntˈuː: bˌiːˈɛn ɹˈaɪt bˈiː, fɔːɹ ˈɔːl stɹˈɪktli pˈɑːzᵻtˌɪv ˈɪntɪdʒɚz .
Given the Boolean domain B = {0,1}, a set F of Boolean functions ƒi: Bni → B is functionally complete if the clone on B generated by the basic functions ƒi contains all functions ƒ: Bn → B, for all strictly positive integers .