Propositional Logic

By definition, propositional logic is the study of joining and/or modifying entire propositions, statements or sentences to form more complicated propositions, statements or sentences. Propositional logic is a major topic in mathematics, computer science, and computer engineering. All three of these majors have to take Math/CSE 261 Discrete Structures, which covers propositional logic in depth. The first class that I studied propositional logic in, although it was called by a different name, was ECE 33 (Introduction to Computer Engineering). Instead of studying propositional logic per say, we studied Boolean algebra. The notation between the two was extremely similar but the symbols were a little different. Boolean algebra was used to analyze digital circuits in this class. Both of these topics deal with AND, OR, TRUE, and FALSE, as well as other statements. In Discrete Structures, instead of dealing with digital circuits, we describe English propositions in terms of propositional logic. This topic has also come up in my Artificial Intelligence class. Many computer programs in artificial intelligence use propositional logic to decide whether something is true or false. That is three classes in two years that dealt with propositional logic so I am sure I will be covering it in more classes in the future.

This entry was posted in Uncategorized. Bookmark the permalink.

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s