Everything About ___
Live briefing

Everything about Functional completeness

Concept in mathematical logic

In logic, a functionally complete set of logical connectives or Boolean operators is one that can be used to express all possible truth tables by combining members of the set into a Boolean expression. A well-known complete set of connectives is { AND, NOT }. Each of the singleton sets { NAND } and { NOR } is functionally complete. However, the set { AND, OR } is incomplete, due to its inability to express NOT. Wikipedia →

🧭 Start here: a 6-step reading path

  1. Read the overview: Functional completenessA 5-minute orientation
  2. Skim a recent paper: Functional completeness of planar Rydberg blockade structuresInfluential work since 2022
  3. Pick up a classic book: Funkcje rekurencyjne i elementy metamatematykiThe most-reprinted book on the subject
  4. Read the landmark paper: Complex brain networks: graph theoretical analysis of structural and functional systemsCited 10,598 times
  5. Go sideways: Logical NORA closely related topic
  6. Go sideways: Sheffer strokeA closely related topic

📖 Definitions

No dictionary entry for this exact phrase.

🏆 Landmark papers (most cited)

🆕 Influential since 2022

📚 Books worth reading

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics