wˌɛn ɐ sˈɪŋɡəl lˈɑːdʒɪkəl kənˈɛktɪv ɔːɹ bˈuːliən ˈɑːpɚɹˌeɪɾɚɹ ɪz fˈʌŋkʃənəli kəmplˈiːt baɪ ɪtsˈɛlf, ɪɾ ɪz kˈɔːld ɐ ʃˈɛfɚ fˈʌŋkʃən ɔːɹ sˈʌmtaɪmz ɐ sˈoʊl səfˈɪʃənt ˈɑːpɚɹˌeɪɾɚ.
When a single logical connective or Boolean operator is functionally complete by itself, it is called a Sheffer function or sometimes a sole sufficient operator.