Talk:De Morgan's laws

This is the talk page for discussing improvements to the De Morgan's laws article.
This is not a forum for general discussion of the article's subject.

Put new text under old text. Click here to start a new topic.
New to Wikipedia? Welcome! Learn to edit; get help.

Article policies

Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL

Archives: 1: 365 days

Mathematics Mid‑priority

	Mathematics portal This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics articles
Mid	This article has been rated as Mid-priority on the project's priority scale.

Computer science Start‑class High‑importance

This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles

Start

This article has been given a rating which conflicts with the project-independent quality rating in the banner shell. Please resolve this conflict if possible.

High

This article has been rated as High-importance on the project's importance scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

Daily pageviews of this article

A graph should have been displayed here but graphs are temporarily disabled. Until they are enabled again, visit the interactive graph at pageviews.wmcloud.org

Substitution form paragraph[edit]

GrkCan's paragraph from July 2020 on the Substitution form really does not make a lot of sense. What is it trying to say? — Preceding unsigned comment added by 125.235.239.193 (talk) 11:08, 21 May 2022 (UTC)[reply]

Discussion[edit]

The proposition "The complement of the union of two sets is the same as the intersection of their complements " is False. Boutarfa1 (talk) 12:03, 24 September 2023 (UTC)[reply]

Discussion[edit]

In the proposition "the complement of the intersection of two sets is the union of the complements of the given sets " some conditions should be precised like that the complements of the given sets can be from the same set as well as the complement of the intersection(some other conditions are possible like when the complement of the intersection is taken from a set that is included in the set that the complements of the given sets are taken from). Boutarfa1 (talk) 12:24, 24 September 2023 (UTC)[reply]

Error in article[edit]

Like halfway through the article there's a big red error. Someones gotta fix that and its not gonna be me76.89.144.233 (talk) 00:59, 5 February 2024 (UTC)[reply]

negative logic[edit]

I might be worthwhile mentioning somewhere here that in a digital circuit, the logical meaning of voltage levels is arbitrary: you can treat a physical high as a logical 1 or as a logical 0. To convert a '1=high' circuit to '1=low', replace each OR with an AND and each AND with an OR (treating other gates as combinations of AND, OR, and NOT). 203.13.3.93 (talk) 03:12, 19 February 2024 (UTC)[reply]

Or ...[edit]

"Not Both" is the same as "Either Not"

"Not Either" is the same as "Both Not"

203.13.3.93 (talk) 02:36, 4 April 2024 (UTC)[reply]