100% satisfaction guarantee Immediately available after payment Both online and in PDF No strings attached
logo-home
Previously searched by you
Previously searched by you
logo
CO2412 Computational Thinking Lecture 17 Notes CA$6.35   Add to cart
Quickly navigate to
Preview
  2.  
  3. University Of Central Lancashire Preston (UClan)
  4.  
  5. Computational Thinking (CO2412)

Class notes

CO2412 Computational Thinking Lecture 17 Notes
 7 views  0 purchase
  • Course
  • Computational Thinking (CO2412)
  • Institution
  • University Of Central Lancashire Preston (UClan)

This document contains detailed notes from Lecture 17 of the CO2412 course on Computational Thinking, focusing on the fundamentals of propositional logic. The lecture provides a thorough introduction to propositional logic, which is used to assess the validity of arguments by applying logical rules...

[Show more]

Preview 1 out of 4  pages

Document information

  • August 20, 2024
  • 4
  • 2023/2024
  • Class notes
  • Amin amini
  • All classes

Subjects

  • computer science
  • computational
  • python
  • algorithms
  • university
  • computer
  • 2nd year
  • efficiency
  • lecture
  • cs
  • notes

Written for

  • University of Central Lancashire Preston (UClan)
  • Unknown
  • Computational Thinking (CO2412)
All documents for this subject (19)

Seller

avatar-seller
BpoBpo

Reviews received

Content preview

CO2412: Computational Thinking
Lecture 17

Propositional Logic
1. What is Propositional Logic?
o Propositional logic is used to establish the validity of arguments. It
provides rules that allow us to judge whether an argument is sound
or unsound, helping us determine whether a conclusion drawn from
stated premises is valid.
2. Propositions
o A proposition is a statement that is either true or false.

o Examples:

o 6 < 24 (True)

o 3 + 2 = 4 (False)

o "Tomorrow is my birthday" (Dependent on context)

3. Non-Propositional Statements
o Questions and exclamations are not propositions because they do
not equate to true or false.
o Examples:

o "Keep off the grass!" (Exclamation)

o "What time is it?" (Question)



Compound Propositions and Connectives
1. Compound Propositions
o Simple propositions can be combined using connectives to form
compound propositions.
o Negation: Reverses the truth value of a proposition. For example, if
p is true, then ¬p (not p) is false.

The benefits of buying summaries with Stuvia:

Guaranteed quality through customer reviews

Guaranteed quality through customer reviews

Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.

Quick and easy check-out

Quick and easy check-out

You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.

Focus on what matters

Focus on what matters

Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!

Frequently asked questions

What do I get when I buy this document?

You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.

Satisfaction guarantee: how does it work?

Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.

Who am I buying these notes from?

Stuvia is a marketplace, so you are not buying this document from us, but from seller BpoBpo. Stuvia facilitates payment to the seller.

Will I be stuck with a subscription?

No, you only buy these notes for CA$6.35. You're not tied to anything after your purchase.

Can Stuvia be trusted?

4.6 stars on Google & Trustpilot (+1000 reviews)

67096 documents were sold in the last 30 days

Founded in 2010, the go-to place to buy study notes for 14 years now

Start selling
CA$6.35
  • (0)
  Add to cart