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
Summary Modelling Computing Systems Extra notities H2 / H3 Faron Moller & Georg Struth $3.23
Add to cart
Quickly navigate to
Preview
  2.  
  3. Universiteit Utrecht (UU)
  4.  
  5. Logica (INFOB1LI)

Summary

Summary Modelling Computing Systems Extra notities H2 / H3 Faron Moller & Georg Struth
 41 views  0 purchase
  • Course
  • Logica (INFOB1LI)
  • Institution
  • Universiteit Utrecht (UU)

Logic for Computer Science/ Computer Technology Logic. Summary of the notes given by the teacher. This substance is tested next to the book Modelling Computing Systems for the exam. Given at Utrecht University.

Preview 2 out of 6  pages

Document information

  • January 25, 2021
  • 6
  • 2020/2021
  • Summary

Subjects

  • error

Written for

  • Universiteit Utrecht (UU)
  • Informatica
  • Logica (INFOB1LI)
All documents for this subject (6)

Seller

avatar-seller
luukvaa

Reviews received

Content preview

Notes deel Hoofdstuk 2 & deel Hoofdstuk 3

Conjunction introduction




If we have a proofstratagie like this, in order to prove a conjunction (P ∧ Q). We need a prove of P
and a proof of Q. We can translate many of these boxes into this form where we use the inference
rule for conjunction to describe if some set of assumptio gamma we can prove P, and from a set
of assumption gamma we can prove Q. Then we know that from some set of assumption gamma
we can prove P ∧ Q.


Conjunction elimination




If we have a prove of P ∧ Q we can always conclude that P holds.




Recall that ¬P behaves just like P ⇒ ⊥. These two rules are really just
instances of the rules for P ⇒ Q, where Q taken to be ⊥.




Similarly, P ⇔ Q behaves the same as P ⇒ Q ∧ Q ⇒ P.

, Conjunction introduction
If you can prove P, than you know that P V Q
holds, if you can prove Q than you know that P
V Q holds.




Conjunction elimination
Suppose we have proven P V Q, to
use a proof we show that some
statement R, if we know that P V Q
holds, if P holds then we can prove R

If Q holds I can prove R, then I can
conclude that R is always going to be
true. Regardless of which of P or Q is
true.




If we know P ∨ Q holds:

− … and we know that R holds whenever P does;
− … and we know that R holds whenever Q does;
− … we can conclude that R must always hold.



Exercise:

Give a proof that ⊢ (P ∨ ⊥) ⇒ P.

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 luukvaa. Stuvia facilitates payment to the seller.

Will I be stuck with a subscription?

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

Can Stuvia be trusted?

4.6 stars on Google & Trustpilot (+1000 reviews)

57413 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
$3.23
  • (0)
Add to cart
Added