sˈɪns ˈɛvɹi bˈuːliən fˈʌŋkʃən ʌv æt lˈiːst wˈʌn vˈɛɹɪəbəl kæn biː ɛkspɹˈɛst ɪn tˈɜːmz ʌv bˈaɪnɚɹi bˈuːliən fˈʌŋkʃənz, ˈɛf ɪz fˈʌŋkʃənəli kəmplˈiːt ɪf ænd ˈoʊnli ɪf ˈɛvɹi bˈaɪnɚɹi bˈuːliən fˈʌŋkʃən kæn biː ɛkspɹˈɛst ɪn tˈɜːmz ʌvðə fˈʌŋkʃənz ɪn ˈɛf.
Since every Boolean function of at least one variable can be expressed in terms of binary Boolean functions, F is functionally complete if and only if every binary Boolean function can be expressed in terms of the functions in F.