- Abstract algebra
- >
- Fields of abstract algebra
- >
- Boolean algebra
- >
- Normal forms (logic)

- Arithmetic
- >
- Binary arithmetic
- >
- Boolean algebra
- >
- Normal forms (logic)

- Computer arithmetic
- >
- Binary arithmetic
- >
- Boolean algebra
- >
- Normal forms (logic)

- Fields of abstract algebra
- >
- Lattice theory
- >
- Boolean algebra
- >
- Normal forms (logic)

- Fields of mathematics
- >
- Fields of abstract algebra
- >
- Boolean algebra
- >
- Normal forms (logic)

- Fields of mathematics
- >
- Mathematical logic
- >
- Boolean algebra
- >
- Normal forms (logic)

- Formal systems
- >
- Systems of formal logic
- >
- Propositional calculus
- >
- Normal forms (logic)

- Logical expressions
- >
- Propositions
- >
- Propositional calculus
- >
- Normal forms (logic)

- Mathematical logic
- >
- Classical logic
- >
- Propositional calculus
- >
- Normal forms (logic)

- Mathematical logic
- >
- Logic in computer science
- >
- Logic programming
- >
- Normal forms (logic)

- Mathematics of computing
- >
- Logic in computer science
- >
- Logic programming
- >
- Normal forms (logic)

- Order theory
- >
- Lattice theory
- >
- Boolean algebra
- >
- Normal forms (logic)

- Philosophy of mathematics
- >
- Mathematical logic
- >
- Boolean algebra
- >
- Normal forms (logic)

- Positional numeral systems
- >
- Binary arithmetic
- >
- Boolean algebra
- >
- Normal forms (logic)

- Theoretical computer science
- >
- Logic in computer science
- >
- Logic programming
- >
- Normal forms (logic)

Disjunctive normal form

In boolean logic, a disjunctive normal form (DNF) is a canonical normal form of a logical formula consisting of a disjunction of conjunctions; it can also be described as an OR of ANDs, a sum of produ

Herbrandization

The Herbrandization of a logical formula (named after Jacques Herbrand) is a construction that is dual to the Skolemization of a formula. Thoralf Skolem had considered the Skolemizations of formulas i

Conjunctive normal form

In Boolean logic, a formula is in conjunctive normal form (CNF) or clausal normal form if it is a conjunction of one or more clauses, where a clause is a disjunction of literals; otherwise put, it is

Algebraic normal form

In Boolean algebra, the algebraic normal form (ANF), ring sum normal form (RSNF or RNF), Zhegalkin normal form, or Reedâ€“Muller expansion is a way of writing logical formulas in one of three subforms:

Negation normal form

In mathematical logic, a formula is in negation normal form (NNF) if the negation operator is only applied to variables and the only other allowed Boolean operators are conjunction and disjunction . N

Beta normal form

In the lambda calculus, a term is in beta normal form if no beta reduction is possible. A term is in beta-eta normal form if neither a beta reduction nor an eta reduction is possible. A term is in hea

Herbrand normal form

No description available.

Horn clause

In mathematical logic and logic programming, a Horn clause is a logical formula of a particular rule-like form which gives it useful properties for use in logic programming, formal specification, and

Prenex normal form

A formula of the predicate calculus is in prenex normal form (PNF) if it is written as a string of quantifiers and bound variables, called the prefix, followed by a quantifier-free part, called the ma

Skolem normal form

In mathematical logic, a formula of first-order logic is in Skolem normal form if it is in prenex normal form with only universal first-order quantifiers. Every first-order formula may be converted in

Blake canonical form

In Boolean logic, a formula for a Boolean function f is in Blake canonical form (BCF), also called the complete sum of prime implicants, the complete sum, or the disjunctive prime form, when it is a d

Head normal form

No description available.

Â© 2023 Useful Links.