Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Combinatorial Logic Circuits

Description

This lecture covers the basics of logical systems, including Boolean algebra, logic gates, mathematical expression of a logical function, and properties of Boolean algebra. It also explains how information is coded in digital circuits using binary system.

Official source

Related concepts (32)

Logical conjunction

In logic, mathematics and linguistics, and () is the truth-functional operator of conjunction or logical conjunction. The logical connective of this operator is typically represented as or or (prefix) or or in which is the most modern and widely used. The and of a set of operands is true if and only if all of its operands are true, i.e., is true if and only if is true and is true. An operand of a conjunction is a conjunct.

Logical disjunction

In logic, disjunction, also known as logical disjunction or logical or or logical addition or inclusive disjunction , is a logical connective typically notated as and read aloud as "or". For instance, the English language sentence "it is sunny or it is warm" can be represented in logic using the disjunctive formula , assuming that abbreviates "it is sunny" and abbreviates "it is warm". In classical logic, disjunction is given a truth functional semantics according to which a formula is true unless both and are false.

Logic gate

A logic gate is an idealized or physical device that performs a Boolean function, a logical operation performed on one or more binary inputs that produces a single binary output. Depending on the context, the term may refer to an ideal logic gate, one that has, for instance, zero rise time and unlimited fan-out, or it may refer to a non-ideal physical device (see ideal and real op-amps for comparison). In the real world, the primary way of building logic gates uses diodes or transistors acting as electronic switches.

Logical consequence

Logical consequence (also entailment) is a fundamental concept in logic which describes the relationship between statements that hold true when one statement logically follows from one or more statements. A valid logical argument is one in which the conclusion is entailed by the premises, because the conclusion is the consequence of the premises.

Boolean algebra

In mathematics and mathematical logic, Boolean algebra is a branch of algebra. It differs from elementary algebra in two ways. First, the values of the variables are the truth values true and false, usually denoted 1 and 0, whereas in elementary algebra the values of the variables are numbers. Second, Boolean algebra uses logical operators such as conjunction (and) denoted as ∧, disjunction (or) denoted as ∨, and the negation (not) denoted as ¬.

Related lectures (25)

Numbers and Booleans

Introduces numbers and booleans in Python, covering numeric types, arithmetic operations, logical operations, and comparisons.

Digital Logic: Circuits and Design

Introduces digital logic, covering Boolean algebra, logic gates, combinational circuits, flip-flops, and state machines.

Logical Circuits: Basics MOOC: Information, Computation, Communication: Introduction to computational thinking

Covers logical circuits, gates, and their combinations to perform basic operations on bits, including adding binary numbers.

Common Multiplicand Speedup

Explores common multiplicand speedup through logical operations like bitwise AND and XOR to optimize the multiplication process.

Boolean Types and Control Structures