ɪn lˈɑːdʒɪk, ɐ fˈʌŋkʃənəli kəmplˈiːt sˈɛt ʌv lˈɑːdʒɪkəl kənˈɛktɪvz ɔːɹ bˈuːliən ˈɑːpɚɹˌeɪɾɚz ɪz wˈʌn wˌɪtʃ kæn biː jˈuːzd tʊ ɛkspɹˈɛs ˈɔːl pˈɑːsᵻbəl tɹˈuːθ tˈeɪbəlz baɪ kəmbˈaɪnɪŋ mˈɛmbɚz ʌvðə sˈɛt ˌɪntʊ ɐ bˈuːliən ɛkspɹˈɛʃən.
In logic, a functionally complete set of logical connectives or Boolean operators is one which can be used to express all possible truth tables by combining members of the set into a Boolean expression.