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 Chapter 3 Faron Moller & Georg Struth $3.35   Add to cart
Quickly navigate to
Preview
  2.  
  3. Universiteit Utrecht (UU)
  4.  
  5. Logic for Computer Science

Summary

Summary Modelling Computing Systems Chapter 3 Faron Moller & Georg Struth
 15 views  0 purchase
  • Course
  • Logic for Computer Science
  • Institution
  • Universiteit Utrecht (UU)
  • Book
  • Modelling Computing Systems

Logic for Computer Science/Logic for Computer Technology Chapter 3 Summary of the book Modelling Computing Systems written by Faron Moller Georg Struth. Summary written in English. Using examples and pictures, the substance and theory are clarified. Given at Utrecht University.

Preview 2 out of 6  pages

Document information

  • No
  • Hoofdstuk 3
  • November 25, 2020
  • 6
  • 2020/2021
  • Summary

Subjects

  • 9781848003217
  • modelling computing systems chapter 3
  • modelling computing systems
  • faron moller georg struth
  • faron moller and georg struth
  • logic for computer science
  • computer technology logic

Connected book

book image

Book Title:

Author(s):

  • Edition:
  • ISBN:
  • Edition:

More summaries for

  • Samenvatting alle stof logica voor informatica
  • Samenvatting Logica voor Informatica (INFOB1LI)
  • Samenvatting Logica voor informatica
All for this textbook (13)

Written for

  • Universiteit Utrecht (UU)
  • Informatica
  • Logic for Computer Science
All documents for this subject (12)

Seller

avatar-seller
luukvaa

Reviews received

Content preview

Hoofdstuk 3

A monoid consist of:

- A set of A
- An element e ∈ A
- A binary operator ⊕

That satisfy the following three laws, for all x, y and z:

1. e ⊕ x = x
2. x ⊕ e = x
3. x ⊕ (y ⊕ z) = (x ⊕ y) ⊕ z

We sometimes say that e is the unit of ⊕. The third law states that the operator ⊕ is
associative(how we put the () ).



A Boolean algabra consist of:

- a set B
- Two elements, 0 ∈ B and 1 ∈ B, called the
zero and unit respectively.
- Two operators + and ·, called the sum and
product respectively.
- A unary operator ‘ called the inverse.

Figure on the right shows the different laws for
Boolean algabra.




Truth tables for Boolean algabra

, Any equation derived from the laws is known as a theorem. We can also show that for all x, we have
x + x = x.

Proof x + x = (x + x) · 1 = (x + x) · (x + x’) = x + (x · x’) = x + 0 = x

Many of these derived theorems follow use the following property. If x + y = x + z and x · y = x · z,
then y = z. In other words, if y and z ‘behave the same’ on every element x, we can conclude that y
and z are equal. We can use this to show that (x’)’ = x.

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.35. You're not tied to anything after your purchase.

Can Stuvia be trusted?

4.6 stars on Google & Trustpilot (+1000 reviews)

83662 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.35
  • (0)
  Add to cart