0 Up votes0 Down votes

171 views6 pagestaller sobre matematica discreta

Mar 05, 2016

© © All Rights Reserved

DOCX, PDF, TXT or read online from Scribd

taller sobre matematica discreta

© All Rights Reserved

171 views

taller sobre matematica discreta

© All Rights Reserved

- 201305 - SPRING 2013 - PHIL 210 - INTRODUCTION TO DEDUCTIVE LOGIC - SCHEDULE
- Logic Demystified - Anthony Boutelle, Stan Gibilisco.pdf
- raeljournalreligion
- Tractatus Logico-Philosophicus by Ludwig Wittgenstein
- The Criteria of Progressive and Reactionary Tendencies in History
- Aaaa
- Book 1
- Variables, Generality and Existence
- Artigo - Why Study the History of Mathematics
- Set Theory
- The Liar Paradox for Real
- Lesson 6
- m001Generating Integrated Inspiration Insight
- couturant-Chap2
- 00b7d521cb0436ab29000000.pdf
- website rubric
- am.pdf
- Intermediate Logic Student Book Sample
- MKE3B21 Semester Assignment Marking Rubric 2nd Semester 2016
- 5 Written Questions

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.

- 201305 - SPRING 2013 - PHIL 210 - INTRODUCTION TO DEDUCTIVE LOGIC - SCHEDULEUploaded bycreativelyinspired
- Logic Demystified - Anthony Boutelle, Stan Gibilisco.pdfUploaded bySagun Raj Basnet
- raeljournalreligionUploaded byillmrpinheiro
- Tractatus Logico-Philosophicus by Ludwig WittgensteinUploaded byWayne Melgaard
- The Criteria of Progressive and Reactionary Tendencies in HistoryUploaded byEric
- AaaaUploaded byRicardo Fazoli
- Book 1Uploaded bymehwishscorpion
- Variables, Generality and ExistenceUploaded byhenrylaycock
- Artigo - Why Study the History of MathematicsUploaded byAna Carolina Pereira
- Set TheoryUploaded byanuj gupta
- The Liar Paradox for RealUploaded bymarcia_pinheiro_2
- Lesson 6Uploaded bylupsaiuoana
- m001Generating Integrated Inspiration InsightUploaded byAnonymous 8erOuK4i
- couturant-Chap2Uploaded bylosolores
- 00b7d521cb0436ab29000000.pdfUploaded byJonatas Taimon
- website rubricUploaded byapi-284753782
- am.pdfUploaded byJude-lo Aranaydo
- Intermediate Logic Student Book SampleUploaded bycompasscinema
- MKE3B21 Semester Assignment Marking Rubric 2nd Semester 2016Uploaded byJeremySinyane
- 5 Written QuestionsUploaded byKooking Jubilo
- A Logician's Fairy Tale. H.L.a. HartUploaded byMaria Ines Pazos
- writing5Uploaded byapi-345807204
- 論卡普納的邏輯語法學Uploaded byleeyuen_a
- Pragmatism.docxUploaded byNazir
- P. T. Geach, Peter Thomas Geach-Reference and Generality_ an Examination of Some Medieval and Modern Theories (Contemporary Philosophy) (1980)Uploaded byru
- Fuzzy Logic the OriginsUploaded byDaniel Martinez
- Consolidated Symbolic Logic Report 8.1 8.5 (2)Uploaded byKlydeen Agito
- TheArgumentfromCollections.pdfUploaded bymilton
- The Jain Theory of Sevenfold PredicationUploaded byJason Cullen
- Qiyas_A_Study_in_Islamic_Logic.pdfUploaded byvordevan

- Notes on Optimisation TheoryUploaded byHawkins Chin
- The Object of Mathematics LearningUploaded byRamadan
- DescartesUploaded byzgoggin
- being, univocity and logical syntax - Adrian MooreUploaded byRui Mascarenhas
- Although the Word Fatalism Usually Implies an Approach of Resignation Towards a Future Event or an Event That is InevitableUploaded byKareem Traboulsi
- Surrogates and Empty Intentions IntroductionUploaded byOscar Arsonist
- Karl Rahner, Johannes Metz Spirit in the WorldUploaded byPaulo Andrade Vitória
- DEWEY Reconstruction in Philosophy 1920Uploaded byruiampereira
- Teaching Demo 1Uploaded byBrian Reyes Gangca
- Klaus Günther on AlexyUploaded byEnrique Sotomayor Trelles
- Al-Ghazali - Deliverance From ErrorUploaded byfilvaniel
- lois-sem.pdfUploaded byShivam mittal
- My Teaching; Jacques LacanUploaded bygmomeni
- Case Study GrunbaumUploaded byIrene Torres
- ICS2308 Artificial Intelligence Notes.pdfUploaded byTim Njagi
- Spinoza study guideUploaded bySujay Pandit
- PHIL 312-Analytic Philosophy-Shabbir Ahsen.pdfUploaded byAsim Raza
- Pigden - Nihilism, Nietzsche, and the Doppelganger Problem.pdfUploaded byCedric Zhou
- La Leyenda de Las Dos Coumnas Prediluviales - AlvaradoUploaded byCody Nguyen
- Morris Mano ch01.pptUploaded byPraveen Dhawan
- Mendelson- Second Thoughts About Church's Thesis and Mathematical Proofs.the Journal of Philosophy Volume 87 Issue 5 1990 [Doi 10.2307%2F2026831]Uploaded bylosolores
- Danto - The Problem of General LawsUploaded byarabelm
- Coliva Peacocke's Self KnowledgeUploaded byfortyrr
- Enthymeme WorksheetUploaded bycgarmonr
- Lec Part 2 Ta Tctl Zones IlUploaded byManjunath Mj
- Michael Friedman. (1992) Epistemology in the 'Aufbau'Uploaded byEdward Hyde
- mcs-013Uploaded byrajeshm82
- Tools of RhetoricUploaded byKathlyn Enciso
- Berto, Matteo Plebani - Ontology and MetaontologyUploaded byAlejandro Vázquez del Mercado
- BrummettUploaded byChristie Daniels

## Much more than documents.

Discover everything Scribd has to offer, including books and audiobooks from major publishers.

Cancel anytime.