Geschreven door studenten die geslaagd zijn Direct beschikbaar na je betaling Online lezen of als PDF Verkeerd document? Gratis ruilen 4,6 TrustPilot
logo-home
Overig

COS2661 Assignment 3 memo 2024

Beoordeling
4,0
(4)
Verkocht
21
Pagina's
6
Geüpload op
23-08-2024
Geschreven in
2024/2025

COS2661 Assignment 3 memo 2024: QUESTION 1 [15] In this question you have to translate sentences of English sentences into First-Order Logic, using the predicates and names given in Table 1. English FOLComment TabisoTabisoThe name of a boy. StudentstudentTafaratafaraPetpet Names The name of a girl. Predicates x is smallSmall (x) x is largeLarge (x) x LeftOf yLeftOf (x, y) x Smaller ySmaller (x, y) x Larger yLarger (x, y) x Owned yOwned (x, y) x BackOf yBackOf (x, y) x Gave yGave (x, y) x Fed yFed (x, y) x Own yOwn (x, y) x is smartSmart Smart referring to intelligent Table 1 1.1Nothing to the left of Tabiso is larger than everything to the left of Tafara. (3) 1.2Anything to the left of Tabiso is smaller than something that is in back of every pet to the right of Tafara.(3) 1.3Every student gave a pet to some other student sometime or other.(3) 1.4No student fed every pet.(3) 1.5If Tabiso ever gave Tafara a pet, she owned it then and he didn’t.(3) 2COS2661/105/0/2024 QUESTION 2 [15] In this question you have to translate sentences of First-Order Logic into English sentences, using the predicates and names given in Table 1. 2.1∀x (¬∃y FrontOf(y, x) → Large (x)) (3) 2.2∀x ((Student(x) ∧ ∃y (Pet(y) ∧ LeftOf(x; y))) → Own(x, y)) (3) 2.3∀x∀y ((Between (tafara, x, y) ∧ x ≠ y) → (Small(x) ∧ Small(y))) (3) 2.4∀x ((Pet(x) ∧ ∀y ¬BackOf (y, z)) → ¬∃z (Pet(z) ∧ x ≠ z ∧ Smaller (x, z)) (3) 2.5∃x∃y [Student (x) ∧ Student (y) ∧ x ≠ y ∧ ∀z(Student(z) → (z = x ˅ z = y)) ∧ Smart (x) ∧ Smart (y)] (3) QUESTION 3 [10] Below a Tarski World is given followed by ten sentences. Which of the sentences are true and which sentences are false in the given world? back a: C, M f: D, S left right d: T, M e: C, S b: D, L c: T, L front Tarski World: Question 5Sentences: 1.∃x ∀y ¬SameSize(y, x) 2.∀x (Tet(x) → ∀y ∃z (Cube(y) ∧ Tet(z) ∧ RightOf(y, x) ∧ LeftOf(x, z))) 3.∀x ∀y (Adjoins (x, y) → ¬SameSize(x, y)) 4.∀x∀y [¬ (Tet(x) ∧ Smaller(x, y))  Medium(x)] 5.∀x∀y [(Dodec(x) ∧ Dodec(y)) → (LeftOf(x, y)  RightOf(x, y))] 6.∃y ∀x (Medium(y) → (Tet(y) ∧ (Cube(x) → Smaller(y, x)))) 7.∀x∀y[(Tet(x) ∧ Cube(y)) → Larger(x, y)] 8.∃x ∃y (Cube(x) ∧ Tet(y) ∧ ¬SameSize(x, y)) 9.∃x ∃y [x ≠y ∧ Tet(x) ∧ Tet(y) ∧ Medium(x) ∧ Medium(y)] 10.Cube(d) → ∀x ∀y SameShape(x, y) QUESTION 4[15] 4.1(5) Transform the following formula into the prenex normal form: x ((C(x)  y (T(y)  L(x, y))) → y (D(y)  B(x, y))) 4.2Find the prenex normal form of ∀x (∃y R(x, y) ∧ ∀y ¬S(x, y) → ¬(∃y R(x, y) ∧ P))(5) 4.3Transform the following formula into prenex normal form:(5) x (P(x) → ((y)(P(y) → P(f(x,y)))  (y)(Q(x,y) →P(y)))) QUESTION 5 [45] In this question, you have to construct formal proofs using the natural deduction rules. The Fitch system makes use of these rules. A summary of the rules of natural deduction is given on pages 573 to 578 of your textbook. Consult this when you do this question. Remember that De Morgan’s laws and other tautologies are not permissible natural deduction rules. You are also not allowed to use Taut Con, Ana Con or FO Con. It is important to number your statements, to indicate subproofs and at each step to give the rule that you are using. Hint: If you have access to a computer, take advantage of the fact and use Fitch. 5.1 (Formally) prove that the following two premises are contradictory: 4 1.x Clever(x) 2.x  Clever(x) (6)COS2661/105/0/2024 5.2 Using the natural deduction rules, give a formal proof of: ∀x∀y(Ixy→ Iyx) ∴ ∀x∀y(Ixy ↔ Iyx ) 5.3 (12) Construct a proof for the argument: ∀x∀y∀z[(Sxy ∧ Syz) → Sxz], ∀x¬Sxx ∴ ∀x∀y(Sxy → ¬Syx) 5.4 (13) Construct a proof for the argument: ∀x∃yRxy ∀x∀y(Rxy→∃zRzx), ∀x∀y(Ryx→∀zRxz) ∴∀x∀yRxy

Meer zien Lees minder
Instelling
Vak

Voorbeeld van de inhoud

COS2661 Assignment 3 2024
solutions
Crystal Indigo!
Crystal Indigo!
Providing all solutions you need anytime
+27 76 626 8187

, QUESTION 1 In this question you have to translate sentences of English
sentences into First-Order Logic, using the predicates and names given
in Table 1

1.1 Nothing to the left of Tabiso is larger than everything to the left of
Tafara.
¬∃x (LeftOf(x, Tabiso) ∧ ∀y (LeftOf(y, Tafara) → Larger(x, y)))

1.2 Anything to the left of Tabiso is smaller than something that is in
back of every pet to the right of Tafara.
∀x (LeftOf(x, Tabiso) → ∃y (Pet(y) ∧ RightOf(Tafara, y) ∧ BackOf(y, z) ∧ Smaller(x, z)))

1.3 Every student gave a pet to some other student sometime or other.
∀x (Student(x) → ∃y ∃z (Student(y) ∧ Pet(z) ∧ x ≠ y ∧ Gave(x, z, y)))

1.4 No student fed every pet.
¬∃x (Student(x) ∧ ∀y (Pet(y) → Fed(x, y)))

1.5 If Tabiso ever gave Tafara a pet, she owned it then, and he didn’t.
∃z (Pet(z) ∧ Gave(Tabiso, z, Tafara) → (Own(Tafara, z) ∧ ¬Own(Tabiso, z)))


Question 2

2.1 ∀x (¬∃y FrontOf(y, x) → Large(x))
If nothing is in front of something, then that thing is large.

2.2 ∀x ((Student(x) ∧ ∃y (Pet(y) ∧ LeftOf(x, y))) → Own(x, y))
Every student who has a pet to their left owns that pet.

2.3 ∀x∀y ((Between(tafara, x, y) ∧ x ≠ y) → (Small(x) ∧ Small(y)))
If Tafara is between two distinct objects, then both objects are small.


2.4 ∀x ((Pet(x) ∧ ∀y ¬BackOf(y, z))→¬∃z (Pet(z) ∧ x ≠ z ∧ Smaller(x, z))
If a pet has nothing behind it, then there is no other pet smaller than it.


2.5 ∃x∃y [Student(x) ∧ Student(y) ∧ x ≠ y ∧ ∀z(Student(z) → (z = x ˅ z
= y)) ∧ Smart(x) ∧ Smart(y)]
There are two distinct students who are the only smart students in the group.

Geschreven voor

Instelling
Vak

Documentinformatie

Geüpload op
23 augustus 2024
Aantal pagina's
6
Geschreven in
2024/2025
Type
OVERIG
Persoon
Onbekend

Onderwerpen

€5,47
Krijg toegang tot het volledige document:
Gekocht door 21 studenten

Verkeerd document? Gratis ruilen Binnen 14 dagen na aankoop en voor het downloaden kan je een ander document kiezen. Je kan het bedrag gewoon opnieuw besteden.
Geschreven door studenten die geslaagd zijn
Direct beschikbaar na je betaling
Online lezen of als PDF

Beoordelingen van geverifieerde kopers

Alle 4 reviews worden weergegeven
1 jaar geleden

1 jaar geleden

1 jaar geleden

1 jaar geleden

4,0

4 beoordelingen

5
2
4
1
3
0
2
1
1
0
Betrouwbare reviews op Stuvia

Alle beoordelingen zijn geschreven door echte Stuvia-gebruikers na geverifieerde aankopen.

Maak kennis met de verkoper

Seller avatar
De reputatie van een verkoper is gebaseerd op het aantal documenten dat iemand tegen betaling verkocht heeft en de beoordelingen die voor die items ontvangen zijn. Er zijn drie niveau’s te onderscheiden: brons, zilver en goud. Hoe beter de reputatie, hoe meer de kwaliteit van zijn of haar werk te vertrouwen is.
CrystalIndigo University of South Africa (Unisa)
Volgen Je moet ingelogd zijn om studenten of vakken te kunnen volgen
Verkocht
486
Lid sinds
5 jaar
Aantal volgers
226
Documenten
73
Laatst verkocht
5 maanden geleden
CrystalIndigo Solutions

providing all solutions to all computer science modules

4,1

51 beoordelingen

5
27
4
13
3
6
2
1
1
4

Populaire documenten

Recent door jou bekeken

Waarom studenten kiezen voor Stuvia

Gemaakt door medestudenten, geverifieerd door reviews

Kwaliteit die je kunt vertrouwen: geschreven door studenten die slaagden en beoordeeld door anderen die dit document gebruikten.

Niet tevreden? Kies een ander document

Geen zorgen! Je kunt voor hetzelfde geld direct een ander document kiezen dat beter past bij wat je zoekt.

Betaal zoals je wilt, start meteen met leren

Geen abonnement, geen verplichtingen. Betaal zoals je gewend bent via Bancontact, iDeal of creditcard en download je PDF-document meteen.

Student with book image

“Gekocht, gedownload en geslaagd. Zo eenvoudig kan het zijn.”

Alisha Student

Veelgestelde vragen