171 views

Uploaded by Andres Felipe Benavides Montoya

taller sobre matematica discreta

- Year 7 Assessment
- Girard's Proofs and Types
- health ethics & logic
- MSP Exercise 03 Solutions Fln
- s a Planar Defect. This Too is a Very Conservative Treatment of the Flaw Type but Provides a Handy Method of Allowing Some Sort of Quantification for Ultrasonic Testing.
- Sl Primer
- :The-Study-of-Indian-and-Tibetan-Thought-Some-Problems-and-Perspectives
- Nicholas_of_Cusas_Paradoxes_and_Non-Clas.pdf
- Section 1 3
- writing rubric
- Origins of Boolean Algebra in the Logic of Classes - John Venn and C S Pierce 22-5-2011
- 312088799 07 Necessitism as a Metaphysical Alternative to Possibilism
- Syllabus Even 2018
- 1st Topic Edited
- Chapter 4 mathematical reasoning
- Logic of Phantasy 05
- In Love With a Wrong Man
- syllogisms 1
- SMARANDACHE FACTOR PARTITIONS OF A TYPICAL CANONICAL FORM.
- Levi 2010 (Dewey'sLogicOfInquiry)

You are on page 1of 6

Lgica

de

Predicados

these truth values?

a) P(0) b) P(4)

c) P(6)

2. Let

be the statement the word

the

contains

the capital of y.

What are these truth values?

3. Let

a) Q(Paris,

Italia)

b) Q(Madrid,

Espaa)

c) Q(Per,

Lima)

d) Q(Costa

Rica,

San

Jos)

=

5. Let P(x) be the statement x spends more than five

hours every weekday in class, where the domain for

x consists of all students. Express each of these

quantifications in English.

a) xP(x)

b) xP(x)

c) x P(x) d) x P(x)

Trabaje

y

solo

los

d.

incisos

a.

a) xP(x)

There exists a student who spends more than

five hours every weekday in class.

1

ICS 141: Discrete Mathematics I (Fall 2014)

b) xP(x)

Every student spends more than five hours

every weekday in class.

c) xP(x)

There exists a student who does not spend

more than five hours every weekday in class.

d) xP(x)

No student spends more than five hours every

weekday in class.

Q(x) be the statement x knows the computer language

Q(x) C++,.quantifiers,Express eachandoflogicalthese

sentencesconnectives.in termsTheofdomainP(x), for

quantifiers consists of all students at your school.

a) There is a student at your school who can speak Rusb) Theresian andis awhostudentknowsat your C++school.

who can speak Rusc) sianEverybutstudent who doesnt know C++. can

speak Russian at your school either

d) or knows C++.

NostudentatyourschoolcanspeakRussianorknows

C++.

Trabaje

y

solo

los

d.

incisos

a.

consists of the integers, what are these truth values?

a) P(0) b) P(1)

d) P(1)

Trabaje

c) P(2)

e) xP(x)

solo

d.

los

y

f) xP(x)

incisos

a.,

e.

2

. If the domain consists of all the integers, what

are these truth

values?

a) P(0)

True

c P(2)

False

e xP(x)

True

f xP(x)

False

into logical expressions using predicates,

quantifiers, and logical connectives. First, let the

domain consist of the students in your class and

second, let it consist of all people.

a) Someone in your class can speak Hindi.

b) Everyone in your class is friendly.

c) There is a person in your class who was not born in

California.

d) A student in your class has been in a movie.

e) No student in your class has taken a course in logic

programming.

Trabaje

y

solo

los

d.

incisos

a.

expressions using predicates, quantifiers, and logical

connectives. First, let the domain consist of the students in

your class and second, let it consist of all people.

a) Someone in your class can speak Hindi.

xH(x) and x(C(x) /\ (H(x)), where H(x) is x can speak

Hindi.

b) Everyone in your class is friendly.

F(x) and x(C(x) F(x)), where F(x) is x is friendly.

c) There is a person in your class who was not born in

California.

xB(x) and x(C(x) /\ B(x)), where B(x) is x was born in

California.

d) A student in your class has been in a movie.

xM(x) and x(C(x) /\ M(x)), where M(x) is x has been in a

movie.

e) No student in your class has taken a course in logic

programming.

xL(x) and x(C(x) L(x)), where L(x) is x has taken a

course in logic programming.

expressions using predicates, quantifiers, and

logical connectives.

a) No one is perfect.

b) Not everyone is perfect.

c) All your friends are perfect.

d) At least one of your friends is perfect.

Trabaje

solo

c.

los

y

incisos

a.,

e.

Problem 4.

Translate each of these statements into logical

expressions using predicates, quantifiers, and

logical connectives:

P(x) x is perfect; F(x) x is your friend

a) No one is perfect: xP(x)

b) Not everyone is perfect: P(x)

c) All your friends are perfect: x[F(x) P(x)]

d) At least one of your friends is perfect: x[F(x)

P(x)]

e) Everyone is your friend and is perfect: x[F(x)

P(x)]

perfect: xF(x) xP(x)

=[xF(x) xP(x)] = x[F(x) P(x)]

33. Express each of these statements using quantifiers. Then form the

negation of the statement, so that no negation is to the left of a

quantifier. Next, express the negation in simple English. (Do not

simply use the phrase It is not the case that.)

a) Some old dogs can learn new tricks.

b) No rabbit knows calculus.

c) Every bird can fly.

d) There is no dog that can talk.

e) There is no one in this class who knows French and

Russian.

Trabaje

y

solo

los

d.

incisos

a.

Problem 7.

Express each of these statements using

quantifiers. Then form the negation of the

statement so that no negation is to the left of the

quantifier. Next express the negation in simple

English.

a) Some old dogs can learn new tricks.

O(x) x is old; T(x) x can learn new tricks

x[O(x) T(x)]

b) No rabbit knows calculus.

C(x) x knows calculus; Domain = all rabbits

xC(x)

c) Every bird can fly.

F(x) x can fly; B(x) x is a bird

x[B(x) F(x)]

d) There is no dog that can talk.

T(x) x can talk; Domain all dogs

xT(x)

e) There is no one in this class who knows French

and Russian.

F(x) x knows French; R(x) x knows

Russian; Domain class

x[F(x) R(x)]

Then form the negation of the

statement, so that no negation is to the left of a

quantifier. Next, express the negation

is not the case that).

a) Some dogs can learn new tricks.

Let T(x) be the predicate that x can learn new

tricks, and let the domain be old

dogs:

xT(x)

Negation: xT(x): No old dogs can learn new

tricks.

b) No rabbit knows calculus.

Let C(x) be the predicate that x knows calculus, and

let the domain be rabbits:

xC(x)

Negation: xC(x): There is a rabbit that knows

calculus.

c) Every bird can fly.

Let F(x) be the predicate that x can fly, and let the

domain be birds:

xF(x)

Negation: xF(x): There is a bird who cannot fly.

d) There is no dog that can talk.

Let T(x) be the predicate that x can talk, and let the

domain be dogs:

xT(x)

Negation: xT(x): There is a dog that talks.

e) There is no one in this tutorial who knows Irish

and Russian.

Let F(x) and R(x) be the predicate that x knows Irish

and knows Russian, respectively,

and let the domain be people in this tutorial:

x(F(x) R(x))

Negation: x(F(x) R(x)): There is someone in this

class who knows Irish and

Russian.

- Year 7 AssessmentUploaded byS TANCRED
- Girard's Proofs and TypesUploaded bycowmoo
- health ethics & logicUploaded byslumberdoll
- MSP Exercise 03 Solutions FlnUploaded byD Koushik Reddy
- s a Planar Defect. This Too is a Very Conservative Treatment of the Flaw Type but Provides a Handy Method of Allowing Some Sort of Quantification for Ultrasonic Testing.Uploaded bySanket Kare
- Sl PrimerUploaded bybatman2227
- :The-Study-of-Indian-and-Tibetan-Thought-Some-Problems-and-PerspectivesUploaded byFelipe Trovão
- Nicholas_of_Cusas_Paradoxes_and_Non-Clas.pdfUploaded byEugen Russo
- Section 1 3Uploaded bySeung Gyun Kim
- writing rubricUploaded byapi-282327837
- Origins of Boolean Algebra in the Logic of Classes - John Venn and C S Pierce 22-5-2011Uploaded byJargons Nether En
- 312088799 07 Necessitism as a Metaphysical Alternative to PossibilismUploaded byElena Rusu
- Syllabus Even 2018Uploaded byCS Dept
- 1st Topic EditedUploaded byKim Dian Junsu
- Chapter 4 mathematical reasoningUploaded byaqiera
- Logic of Phantasy 05Uploaded byChun-hsiung Chen
- In Love With a Wrong ManUploaded byNeric Ico Magleo
- syllogisms 1Uploaded bysatyam ray
- SMARANDACHE FACTOR PARTITIONS OF A TYPICAL CANONICAL FORM.Uploaded byMia Amalia
- Levi 2010 (Dewey'sLogicOfInquiry)Uploaded byflip_lindo
- CROCE, Benedetto. What is living and what is dead in HegelUploaded byjestovonaporno
- Logical Positivism is TrashedUploaded byAnthony Fejfar
- Set-builder_notation.pdfUploaded bymars
- Facts About SyllogismsUploaded byRama Nathan
- Solving Leontief IOModel With Trapezoidal Fuzzy Numbers and Gauss-Seidel AlgorithmUploaded byHannah Mae Sabalande Mayol
- 03 Agentmodel HandoutUploaded byStorm Bk-kt Npld
- TOK ThemesUploaded byPep Mac Ruairi
- HUM&101 Module02 Introduction to Philosophy - Origins and Branches ReadingUploaded byLeire Jacutan
- Artificial IntelligenceUploaded byCool Yo
- PresuppositionUploaded byIlmiatulHa

- Guia Avanzada NmapUploaded byFranz León
- Teoria de ColasUploaded byAndres Felipe Benavides Montoya
- Taller Teoria de La ComputaciondocxUploaded byAndres Felipe Benavides Montoya
- Expresiones RegularesUploaded byAndres Felipe Benavides Montoya
- AFD a AFN.docxUploaded byAndres Felipe Benavides Montoya
- AFD a AFN.docxUploaded byAndres Felipe Benavides Montoya

- DURGA PRAVEEN CVUploaded byAnish Raj
- dektec-DTU-215Uploaded byAlexander Wiese
- Konica-Minolta Bizhub 361, BizHub 421, Bizhub 501 Theory of Operation Service ManualUploaded bybramirez8098
- 11-LPDAUploaded byQuoc Nguyen
- NOUGAT 7 battery logUploaded byPavithra
- Parallel Computer ArchitectureUploaded byJeena Mol Abraham
- Belga_Nav1_v2.pdfUploaded byeumesmo222
- 02 McRNC Software Architecture (1)Uploaded byआशुतोष कुमार सिह
- BenchmarksUploaded byAquaxi
- c++faqUploaded byItachi Dattatreya
- Esp32 Datasheet EnUploaded byCarlos Gallardo
- p8n_Uploaded byriddler_007
- IES Electrical Engineering Topic Wise Questions PDF UploadUploaded bySivaranjani
- DcdiagUploaded bySreenivasan Nagappan
- e10226.pdfUploaded byvijay kumar
- Start Stop Cluster DBsUploaded byNarayan Jayaram
- Difference b/w ppmv, mg/L and ppmwUploaded byBoon Ng
- ARRIALEXAUserManualUploaded byrsjvenkatesh6922
- Assignment 2 IITD CSEUploaded byint0
- Android Sample Source Code_ Android Reading Inbox SMSUploaded byVairamoorthy Arunachalam
- Advance R Cheat sheetUploaded byAlaskaTar3
- Comparison With Castellated Beams PDFUploaded bypradz71
- Karolina - Ce on Snell's LawUploaded byChirag Hablani
- Exclusive or Gate PDFUploaded byVasu
- Wp Connecting Remote and Mobile Assets to the Pi System Lt EnUploaded byfire&gas
- BM626 WiMAX CPE Online Help%28V100R001_05%2Cbasic%29Uploaded byOgbenyi Egbe
- PMP1Uploaded byShing Ho
- Main Drivers of the Bitcoin PriceUploaded byRohtash Singh Rathore
- Convolutional Coding Viterbi AlgorithmUploaded byapi-3827370
- Vacancy in CAP IIUploaded bypankajdharmadhikari