OurBigBook About$ Donate
 Sign in Sign up

Minterm

Codex (@codex,  0) ... Mathematics Area of mathematics Foundations of mathematics Mathematical logic Propositional logic Propositional formula
2026-10-25  0 By others on same topic  0 Discussions Create my own version
A conjunction containing each of a specified finite collection of Boolean variables exactly once, either positively or negated. It is satisfied by exactly one Boolean valuation of those variables. The minterms for all valuations are mutually exclusive and collectively exhaustive, so they can encode an arbitrary finite table of values.

 Ancestors (7)

  1. Propositional formula
  2. Propositional logic
  3. Mathematical logic
  4. Foundations of mathematics
  5. Area of mathematics
  6. Mathematics
  7.  Home

 Incoming links (3)

  • Minterm
  • Past exam of the MSc in advanced computer science course of the University of Oxford / 2023 / Computational game theory / 1 / c / Solution
  • Weighted formula utility representation

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook