Minimal axioms for Boolean algebra

Propositional calculus | Boolean algebra | Logic gates

In mathematical logic, minimal axioms for Boolean algebra are assumptions which are equivalent to the axioms of Boolean algebra (or propositional calculus), chosen to be as short as possible. For example, if one chooses to take commutativity for granted, an axiom with six NAND operations and three variables is equivalent to Boolean algebra : where the vertical bar represents the NAND logical operation (also known as the Sheffer stroke). It is one of 25 candidate axioms for this property identified by Stephen Wolfram, by enumerating the Sheffer identities of length less or equal to 15 elements (excluding mirror images) that have no noncommutative models with four or fewer variables, and was first proven equivalent by William McCune, Branden Fitelson, and Larry Wos. MathWorld, a site associated with Wolfram, has named the axiom the "Wolfram axiom". McCune et al. also found a longer single axiom for Boolean algebra based on disjunction and negation. In 1933, Edward Vermilye Huntington identified the axiom as being equivalent to Boolean algebra, when combined with the commutativity of the OR operation, , and the assumption of associativity, . Herbert Robbins conjectured that Huntington's axiom could be replaced by which requires one fewer use of the logical negation operator . Neither Robbins nor Huntington could prove this conjecture; nor could Alfred Tarski, who took considerable interest in it later. The conjecture was eventually proved in 1996 with the aid of theorem-proving software. This proof established that the Robbins axiom, together with associativity and commutativity, form a 3-basis for Boolean algebra. The existence of a 2-basis was established in 1967 by Carew Arthur Meredith: The following year, Meredith found a 2-basis in terms of the Sheffer stroke: In 1973, Padmanabhan and Quackenbush demonstrated a method that, in principle, would yield a 1-basis for Boolean algebra. Applying this method in a straightforward manner yielded "axioms of enormous length", thereby prompting the question of how shorter axioms might be found. This search yielded the 1-basis in terms of the Sheffer stroke given above, as well as the 1-basis which is written in terms of OR and NOT. (Wikipedia).

Boolean Algebra: Sample Problems

In this video, I work through some sample problems relating to Boolean algebra. Specific, I work through examples of translating equivalences from logical or set notation to Boolean notation, and also a derivation using Boolean equivalences.

From playlist Discrete Mathematics

Boolean Values

From playlist Week 1 2015 Shorts

Maximum and Minimum Values (Closed interval method)

A review of techniques for finding local and absolute extremes, including an application of the closed interval method

From playlist 241Fall13Ex3

Calculus: Absolute Maximum and Minimum Values

In this video, we discuss how to find the absolute maximum and minimum values of a function on a closed interval.

From playlist Calculus

Boolean Algebra 2 – Simplifying Complex Expressions

This video follows on from the one about the laws of Boolean algebra. It explains some useful interpretations of the laws of Boolean algebra, in particular, variations of the annulment and distributive laws. It goes on to demonstrate how Boolean algebra can be applied to simplify comple

From playlist Boolean Algebra

Boolean Algebra 1 – The Laws of Boolean Algebra

This computer science video is about the laws of Boolean algebra. It briefly considers why these laws are needed, that is to simplify complex Boolean expressions, and then demonstrates how the laws can be derived by examining simple logic circuits and their truth tables. It also shows ho

From playlist Boolean Algebra

What We've Learned from NKS Chapter 12: The Principle of Computational Equivalence [Part 2]

In this episode of "What We've Learned from NKS", Stephen Wolfram is counting down to the 20th anniversary of A New Kind of Science with [another] chapter retrospective. If you'd like to contribute to the discussion in future episodes, you can participate through this YouTube channel or th

From playlist Science and Research Livestreams

A Quick Overview of BOOLEAN ALGEBRA (symbols, truth tables, and laws)

Error in Video (9:32, 11:30): When talking about the last laws in the columns for equivalences, I say "DeMorgan's Law" when I mean to say "Distributive Law". In this video on #Logic, we learn the basics of #BooleanAlgebra and compare the notation for propositional logic with it. We cover

From playlist Logic in Philosophy and Mathematics

Absolute Maximum and Minimum Values of a Function - Calculus I

This video teaches students how to use the closed interval test to find absolute maximum and minimum values of a function. In particular, I use the first derivative to find critical values of the function. From this step, I show how to find the absolute maximum and minimum values within

From playlist Calculus 1

Evaluate the left and right hand limit of basic ap calculus examples

👉 Learn about the limit of a function. The limit of a function as the input variable of the function tends to a number/value is the number/value which the function approaches at that time. The limit of a function is said to exist if the value which the function approaches as x (or the inde

From playlist Evaluate the Limit..........Help!

Tame topologies in non-archimedean geometry - Abhishek Oswal

Short Talks by Postdoctoral Members Topic: Tame topologies in non-archimedean geometry Speaker: Abhishek Oswal Affiliation: Member, School of Mathematics Date: September 25, 2020 For more video please visit http://video.ias.edu

From playlist Mathematics

Wolfram Physics Project: Working Session Tuesday, Nov. 30, 2021 [Metamathematics]

This is a Wolfram Physics Project working session on metamathematics in the Wolfram Model. Originally livestreamed at: https://twitch.tv/stephen_wolfram Stay up-to-date on this project by visiting our website: http://wolfr.am/physics Check out the announcement post: http://wolfr.am/

From playlist Wolfram Physics Project Livestream Archive

Twitch Talks - Algebra

Presenter: Adam Strzebonski Wolfram Research developers demonstrate the new features of Version 12 of the Wolfram Language that they were responsible for creating. Previously broadcast live on July 18, 2019 at twitch.tv/wolfram. For more information, visit: https://www.wolfram.com/languag

From playlist Twitch Talks

Model Theory - part 04 - Posets, Lattices, Heyting Algebras, Booleans Algebras

This is a short video for people who haven't seen a Heyting algebras before. There is really nothing special in it that doesn't show up in wikipedia or ncatlab. I just wanted to review it before we use them. Errata: *at 3:35: there the law should read (a and (a or b) ), not (a and (a and

From playlist Model Theory

Live CEOing Ep 374: Language Design in Wolfram Language [AxiomaticTheory]

In this episode of Live CEOing, Stephen Wolfram discusses upcoming improvements of AxiomaticTheory for the Wolfram Language. If you'd like to contribute to the discussion in future episodes, you can participate through this YouTube channel or through the official Twitch channel of Stephen

From playlist Behind the Scenes in Real-Life Software Design

Wolfram Physics Project: Working Session Sept. 15, 2020 [Physicalization of Metamathematics]

This is a Wolfram Physics Project working session on metamathematics and its physicalization in the Wolfram Model. Begins at 10:15 Originally livestreamed at: https://twitch.tv/stephen_wolfram Stay up-to-date on this project by visiting our website: http://wolfr.am/physics Check out the

From playlist Wolfram Physics Project Livestream Archive

Jacob Tsimerman - An introduction to O-minimal structures: tameness of the real exponential

This is the first talk in the Minerva Mini-course, Applications of o-minimality in Diophantine Geometry, by Jacob Tsimerman, University of Toronto and Princeton's Fall 2021 Minerva Distinguished Visitor.

From playlist Minerva Mini Course - Jacob Tsimerman

Séminaire Bourbaki - 21/06/2014 - 3/4 - Thomas C. HALES

Developments in formal proofs A for mal proof is a proof that can be read and veriﬁed by computer, directly from the fundamental rules of logic and the foundational axioms of mathematics. The technology behind for mal proofs has been under development for decades and grew out of efforts i

From playlist Bourbaki - 21 juin 2014

Analysis of Boolean Functions on Association Schemes - Yuval Filmus

Yuval Filmus Member, School of Mathematics September 23, 2014 More videos on http://video.ias.edu

From playlist Mathematics

Tame topology and Hodge theory (Lecture 1) by Bruno Klingler

Discussion Meeting Complex Algebraic Geometry ORGANIZERS: Indranil Biswas, Mahan Mj and A. J. Parameswaran DATE:01 October 2018 to 06 October 2018 VENUE: Madhava Lecture Hall, ICTS, Bangalore The discussion meeting on Complex Algebraic Geometry will be centered around the "Infosys-ICT

From playlist Complex Algebraic Geometry 2018

Minimal axioms for Boolean algebra

Related pages