moredumbimpossi said:Please help me with this thing. I'm so frustrated I can't understand propositional logic
Demonstrate this:
(p ∧ q) ↓ q ≡ ¬q
PLEASE.
I like Serena said:Hi moredumbimpossi, welcome to MHB!
What have you tried? Where are you stuck?
Simplest method to prove something like this, is to set up a truth table.
Let's start with p=0 and q=0.
What is (p ∧ q) ↓ q = (0 ∧ 0) ↓ 0 then?
moredumbimpossi said:Hi., thanks for replying
This has to be reduced with the laws of logic
Propositional Logic with NOR is a type of formal logic that uses the logical connective NOR (not or) as its main operator. It is a way of representing and analyzing logical statements and arguments using symbols and rules.
Propositional Logic with NOR differs from other types of logic in that it uses the NOR operator as its main connective, whereas other types of logic may use operators such as AND, OR, and NOT. Additionally, Propositional Logic with NOR is a type of propositional logic, which deals with statements rather than the truth values of those statements.
The basic rules of Propositional Logic with NOR include the NOR truth table, which shows the truth values of different combinations of statements connected with NOR, and the De Morgan's laws, which state that the negation of a statement connected with NOR is equivalent to the conjunction of the negations of the individual statements.
Propositional Logic with NOR is used in various real-world applications, such as in computer science and digital electronics. It is used to analyze and optimize the behavior of digital circuits, and it is also used in computer programming languages to represent logical statements and conditions.
Some common misconceptions about Propositional Logic with NOR include thinking that it is the only type of logic, or that it is the same as Boolean logic. While it is an important type of logic, there are many other types, and Boolean logic includes other operators such as AND and OR in addition to NOR.