1. If it does not rain, or it is not foggy, then the sailing race will be held and the lifesaving demonstration will go on. 2. If the sailing race is held, then the trophy will be awarded. 3. The trophy was not awarded. Show that it rained. Symbolically represent the propositions as follows: r. f: S: d: t: It rained. It was foggy. The sailing race was held. Lifesaving demonstration went on. Trophy was awarded. Then we have:
1. If it does not rain, or it is not foggy, then the sailing race will be held and the lifesaving demonstration will go on. 2. If the sailing race is held, then the trophy will be awarded. 3. The trophy was not awarded. Show that it rained. Symbolically represent the propositions as follows: r. f: S: d: t: It rained. It was foggy. The sailing race was held. Lifesaving demonstration went on. Trophy was awarded. Then we have:
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
100%
Discrete mathematics
Inference
In the example picture I provide, accepting the promises , it suffices show r is one line and it show (e.x premise 3). Follow the example. Use the same format. THANKS!
Transcribed Image Text:Inference
Accept the following Premises
1.
2.
If fish can fly, birds can Swim
If birds can swim, squirrels can
talk
If birds can swim and squirrels
can talk, capybaras can write.
3. If
4. Fish can fly
Show, using the rules of inference,
that capybaras can write
Transcribed Image Text:Accepting the following premises:
1.
If it does not rain, or it is not foggy, then the sailing race will be held and the lifesaving demonstration will
go on.
2. If the sailing race is held, then the trophy will be awarded.
3. The trophy was not awarded.
Show that it rained.
Symbolically represent the propositions as follows:
r.
f:
S:
d:
t:
It rained.
It was foggy.
The sailing race was held.
Lifesaving demonstration went on.
Trophy was awarded.
Then we have:
1. (r Vf) → (s Ad)
2. st
3. t
Accepting the premises, it suffices to show r.
And we have r as desired.
4.
nt
18
(s^ d)
(vf)
fרר r Aרר
&
: r^f
r
Premise 3
Modus tollens, Premise 2
Domination
Modus tollens, Premise 1
De Morgan's
Double negation
Conjunctive simplification
Expert Solution
Step 1
1.
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 2 images
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education