Summary: Every field requires a foundation of precise statements and meanings specific to that development. Here, we will look into the application of logic distinctly for computer science. You may be able to apply this knowledge to other fields as well. This is a student guide on propositional logic. Feel free to contact me if you would like to add to this topic.
Root article: GAME DEVELOPMENT GUIDE
Parent article: DISCRETE MATHEMATICS
This is a quick introduction to the exploration of propositional logic, propositional statements, terms and reasoning for mathematics and computer science
Logic- Method of applying knowledge.
Proposition- In discrete mathematics, a proposition refers to a statement that has a definite value: true or false. Propositions cannot be questions, commands, or any other type of arbitrary statements. Unique variables most commonly used in propositional logic include "p", "q", "r", and "s".
examples:
The car is black.
A lion is a cat.
The weather is cloudy.
February has 30 days.
Truth Value- Propositions can have one of the two definite values: true or false.
examples:
The car is black. This is a TRUE statement.
A lion is a cat. This is a TRUE statement.
The weather is cloudy. This is a TRUE statement.
February has 30 days. This is a FALSE statement.
