Summary
Summary Lectures/Slides
- Course
- Institution
Summary lectures and slides for Skills for AI course of VU Amsterdam. Summary lectures and slides for Skills for AI course at the VU Universiteit Amsterdam VU.
[Show more]
Seller
Followmaudvandenberg
Content preview
Samenvatting Skills for AI – Logic College 1
Declarative sentence (proposition) = a statement that is true or false.
You can abstract an argument in the letters p, q, r , s etc. :
Abstraction: If p and not q, then r. Not r. p. Therefore, q.
With as logical formalization: (((p∧¬q)→r)∧ (¬r∧p)) → q
‘not’ is a unary
connective. All the other
ones are binary. Priority:
With a parse tree you can reconstruct a formula and see if its true or false.
With a truth table you can express functional behavior for each connective.
Formulas φ and ψ are semantically equivalent, notation φ ≡ ψ, if they have identical
columns in their truth tables.
, Conjunction() and disjunction() and the exclusive or() are associative. This means that if
they are alone in the formula, you don’t have to use brackets.
Tautology = always true. In a truth table there is a T/1 on every line. Example: p ∨ ¬p
Contradiction = always false. In a truth table there is a F/0 on every line. Example: p ∧ ¬p
Contingent = sometime true and sometimes false. True when the formula is neither a
tautology, nor a contradiction. Example: p ∧ ¬q
College 2
Bij deze formule
moet je dus bewijzen dat wanneer p is true, not r is true (r is false) en de formule is true: dan
moet q true zijn.
Semantic entailment
Dus bij P entails q:
Wanneer alle keren dat
p waar is, q ook waar is,
klopt het: valid.
Wanneer je een
counterexample vind (p
waar q niet waar) dan niet meer:
invalid
Counterexample
Deduction theorem
Slide 14???
Dan hebben bijde griekse letters exact
dezelfde truthtable.
Metalogic:
Reasoning at a higher abstraction level to answer concrete logical questions.
The benefits of buying summaries with Stuvia:
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
You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.
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 maudvandenberg. Stuvia facilitates payment to the seller.
Will I be stuck with a subscription?
No, you only buy these notes for $7.05. You're not tied to anything after your purchase.
Can Stuvia be trusted?
4.6 stars on Google & Trustpilot (+1000 reviews)
64438 documents were sold in the last 30 days
Founded in 2010, the go-to place to buy study notes for 14 years now