Mathematical Logic Part Two
|
|
- Laurence Dalton
- 6 years ago
- Views:
Transcription
1 Mathematical Logic Part Two
2 Recap from Last Time
3 Recap So Far A propositional variable is a variable that is either true or false. The propositional connectives are as follows: Negation: p Conjunction: p q Disjunction: p q Implication: p q Biconditional: p q True: False:
4 Take out a sheet of paper!
5 What's the truth table for the connective?
6 What's the negation of p q?
7 New Stuff!
8 First-Order Logic
9 What is First-Order Logic? First-order logic is a logical system for reasoning about properties of objects. Augments the logical connectives from propositional logic with predicates that describe properties of objects, functions that map objects to one another, and quantifiers that allow us to reason about multiple objects.
10 Some Examples
11 Likes(You, Eggs) Likes(You, Tomato) Likes(You, Shakshuka) Learns(You, History) ForeverRepeats(You, History) DrinksTooMuch(Me) IsAnIssue(That) IsOkay(Me)
12 Likes(You, Eggs) Likes(You, Tomato) Likes(You, Shakshuka) Learns(You, History) ForeverRepeats(You, History) DrinksTooMuch(Me) IsAnIssue(That) IsOkay(Me)
13 Likes(You, Eggs) Likes(You, Tomato) Likes(You, Shakshuka) Learns(You, History) ForeverRepeats(You, History) DrinksTooMuch(Me) IsAnIssue(That) IsOkay(Me)
14 Likes(You, Eggs) Likes(You, Tomato) Likes(You, Shakshuka) Learns(You, History) ForeverRepeats(You, History) DrinksTooMuch(Me) IsAnIssue(That) IsOkay(Me) These These blue blue terms terms are are called called constant constant symbols. symbols. Unlike Unlike propositional propositional variables, variables, they they refer refer to to objects, objects, not not propositions. propositions.
15 Likes(You, Eggs) Likes(You, Tomato) Likes(You, Shakshuka) Learns(You, History) ForeverRepeats(You, History) DrinksTooMuch(Me) IsAnIssue(That) IsOkay(Me)
16 Likes(You, Eggs) Likes(You, Tomato) Likes(You, Shakshuka) Learns(You, History) ForeverRepeats(You, History) DrinksTooMuch(Me) IsAnIssue(That) IsOkay(Me) The The red red things things that that look look like like function function calls calls are are called called predicates. predicates. Predicates Predicates take take objects objects as as arguments arguments and and evaluate evaluate to to true true or or false. false.
17 Likes(You, Eggs) Likes(You, Tomato) Likes(You, Shakshuka) Learns(You, History) ForeverRepeats(You, History) DrinksTooMuch(Me) IsAnIssue(That) IsOkay(Me)
18 Likes(You, Eggs) Likes(You, Tomato) Likes(You, Shakshuka) Learns(You, History) ForeverRepeats(You, History) DrinksTooMuch(Me) IsAnIssue(That) IsOkay(Me) What What remains remains are are traditional traditional propositional propositional connectives. connectives. Because Because each each predicate predicate evaluates evaluates to to true true or or false, false, we we can can connect connect the the truth truth values values of of predicates predicates using using normal normal propositional propositional connectives. connectives.
19 Reasoning about Objects To reason about objects, first-order logic uses predicates. Examples: IsCute(Quokka) ArgueIncessantly(Democrats, Republicans) Applying a predicate to arguments produces a proposition, which is either true or false.
20 First-Order Sentences Sentences in first-order logic can be constructed from predicates applied to objects: Cute(a) Dikdik(a) Kitty(a) Puppy(a) Succeeds(You) Practices(You) x < 8 x < 137 The The less-than less-than sign sign isis just just another another predicate. predicate. Binary Binary predicates predicates are are sometimes sometimes written written inin infix infix notation notation this this way. way. Numbers Numbers are are not not built built in in to to first-order first-order logic. logic. They re They re constant constant symbols symbols just just like like You You and and a a above. above.
21 Equality First-order logic is equipped with a special predicate = that says whether two objects are equal to one another. Equality is a part of first-order logic, just as and are. Examples: TomMarvoloRiddle = LordVoldemort MorningStar = EveningStar Equality can only be applied to objects; to state that two propositions are equal, use.
22 Let's see some more examples.
23 FavoriteMovieOf(You) FavoriteMovieOf(Her) StarOf(FavoriteMovieOf(You)) = StarOf(FavoriteMovieOf(Her))
24 FavoriteMovieOf(You) FavoriteMovieOf(Her) StarOf(FavoriteMovieOf(You)) = StarOf(FavoriteMovieOf(Her))
25 FavoriteMovieOf(You) FavoriteMovieOf(Her) StarOf(FavoriteMovieOf(You)) = StarOf(FavoriteMovieOf(Her))
26 FavoriteMovieOf(You) FavoriteMovieOf(Her) StarOf(FavoriteMovieOf(You)) = StarOf(FavoriteMovieOf(Her))
27 FavoriteMovieOf(You) FavoriteMovieOf(Her) StarOf(FavoriteMovieOf(You)) = StarOf(FavoriteMovieOf(Her)) These These purple purple terms terms are are functions. functions. Functions Functions take take objects objects as as input input and and produce produce objects objects as as output. output.
28 FavoriteMovieOf(You) FavoriteMovieOf(Her) StarOf(FavoriteMovieOf(You)) = StarOf(FavoriteMovieOf(Her))
29 FavoriteMovieOf(You) FavoriteMovieOf(Her) StarOf(FavoriteMovieOf(You)) = StarOf(FavoriteMovieOf(Her))
30 FavoriteMovieOf(You) FavoriteMovieOf(Her) StarOf(FavoriteMovieOf(You)) = StarOf(FavoriteMovieOf(Her))
31 Functions First-order logic allows functions that return objects associated with other objects. Examples: ColorOf(Money) MedianOf(x, y, z) x+y As with predicates, functions can take in any number of arguments, but always return a single value. Functions evaluate to objects, not propositions.
32 Objects and Predicates When working in first-order logic, be careful to keep objects (actual things) and predicates (true or false) separate. You cannot apply connectives to objects: Venus TheSun You cannot apply functions to propositions: StarOf(IsRed(Sun) IsGreen(Mars)) Ever get confused? Just ask!
33 One last (and major) change
34 For any natural number n, n is even iff n2 is even
35 For any natural number n, n is even iff n2 is even n. (n ℕ (Even(n) Even(n2)))
36 For any natural number n, n is even iff n2 is even n. (n ℕ (Even(n) Even(n2))) isis the the universal universalquantifier quantifier and and says says for for any any choice choice of of n, n, the the following following isis true. true.
37 The Universal Quantifier A statement of the form x. some-formula is true if, for every choice of x, the statement some-formula is true when x is plugged into it. Examples: p. (Puppy(p) Cute(p)) m. (IsMillennial(m) IsSpecial(m)) Tallest(SK) x. (SK x ShorterThan(x, SK))
38 The Universal Quantifier x. Smiling(x)
39 The Universal Quantifier x. Smiling(x)
40 The Universal Quantifier x. Smiling(x)
41 The Universal Quantifier x. Smiling(x)
42 The Universal Quantifier x. Smiling(x)
43 The Universal Quantifier x. Smiling(x)
44 The Universal Quantifier x. Smiling(x)
45 The Universal Quantifier x. Smiling(x) Since SinceSmiling(x) Smiling(x) isistrue truefor forevery every choice of x, choice of x,this this statement statement evaluates evaluatesto totrue. true.
46 The Universal Quantifier x. Smiling(x) Since SinceSmiling(x) Smiling(x) isistrue truefor forevery every choice of x, choice of x,this this statement statement evaluates evaluatesto totrue. true.
47 The Universal Quantifier x. Smiling(x)
48 The Universal Quantifier x. Smiling(x)
49 The Universal Quantifier x. Smiling(x)
50 The Universal Quantifier x. Smiling(x)
51 The Universal Quantifier x. Smiling(x) Since SinceSmiling(x) Smiling(x)isis true truefor forthis thischoice choice x,x,this statement this statement evaluates evaluatesto tofalse. false.
52 The Universal Quantifier x. Smiling(x) Since SinceSmiling(x) Smiling(x)isis true truefor forthis thischoice choice x,x,this statement this statement evaluates evaluatesto tofalse. false.
53 The Universal Quantifier ( x. Smiling(x)) ( y. WearingHat(y))
54 The Universal Quantifier ( x. Smiling(x)) ( y. WearingHat(y))
55 The Universal Quantifier IsIsthis thispart partofofthe the statement true statement trueor or false? false? ( x. Smiling(x)) ( y. WearingHat(y))
56 The Universal Quantifier IsIsthis thispart partofofthe the statement true statement trueor or false? false? ( x. Smiling(x)) ( y. WearingHat(y))
57 The Universal Quantifier IsIsthis thispart partofofthe the statement true statement trueor or false? false? ( x. Smiling(x)) ( y. WearingHat(y))
58 The Universal Quantifier IsIsthis thispart partofofthe the statement true statement trueor or false? false? ( x. Smiling(x)) ( y. WearingHat(y))
59 The Universal Quantifier IsIsthis thisoverall overall statement statementtrue trueor or false in this false in this scenario? scenario? ( x. Smiling(x)) ( y. WearingHat(y))
60 The Universal Quantifier IsIsthis thisoverall overall statement statementtrue trueor or false in this false in this scenario? scenario? ( x. Smiling(x)) ( y. WearingHat(y))
61 Some muggles are intelligent.
62 Some muggles are intelligent. m. (Muggle(m) Intelligent(m))
63 Some muggles are intelligent. m. (Muggle(m) Intelligent(m)) isis the the existential existentialquantifier quantifier and and says says for for some some choice choice of of m, m, the the following following isis true. true.
64 The Existential Quantifier A statement of the form x. some-formula is true if, for some choice of x, the statement some-formula is true when that x is plugged into it. Examples: x. (Even(x) Prime(x)) x. (TallerThan(x, me) LighterThan(x, me)) ( x. Appreciates(x, me)) Happy(me)
65 The Existential Quantifier x. Smiling(x)
66 The Existential Quantifier x. Smiling(x)
67 The Existential Quantifier x. Smiling(x)
68 The Existential Quantifier x. Smiling(x)
69 The Existential Quantifier x. Smiling(x)
70 The Existential Quantifier x. Smiling(x)
71 The Existential Quantifier x. Smiling(x)
72 The Existential Quantifier x. Smiling(x) Since SinceSmiling(x) Smiling(x) isistrue truefor forsome some choice of x, choice of x,this this statement statement evaluates evaluatesto totrue. true.
73 The Existential Quantifier x. Smiling(x) Since SinceSmiling(x) Smiling(x) isistrue truefor forsome some choice of x, choice of x,this this statement statement evaluates evaluatesto totrue. true.
74 The Existential Quantifier x. Smiling(x)
75 The Existential Quantifier x. Smiling(x)
76 The Existential Quantifier x. Smiling(x)
77 The Existential Quantifier x. Smiling(x)
78 The Existential Quantifier x. Smiling(x)
79 The Existential Quantifier x. Smiling(x)
80 The Existential Quantifier x. Smiling(x)
81 The Existential Quantifier x. Smiling(x) Since SinceSmiling(x) Smiling(x)isis not nottrue truefor forany any choice of x, this choice of x, this statement statementevaluates evaluates to false. to false.
82 The Existential Quantifier x. Smiling(x) Since SinceSmiling(x) Smiling(x)isis not nottrue truefor forany any choice of x, this choice of x, this statement statementevaluates evaluates to false. to false.
83 The Existential Quantifier ( x. Smiling(x)) ( y. WearingHat(y))
84 The Existential Quantifier ( x. Smiling(x)) ( y. WearingHat(y))
85 The Existential Quantifier IsIsthis thispart partofofthe the statement true statement trueor or false? false? ( x. Smiling(x)) ( y. WearingHat(y))
86 The Existential Quantifier IsIsthis thispart partofofthe the statement true statement trueor or false? false? ( x. Smiling(x)) ( y. WearingHat(y))
87 The Existential Quantifier IsIsthis thispart partofofthe the statement true statement trueor or false? false? ( x. Smiling(x)) ( y. WearingHat(y))
88 The Existential Quantifier IsIsthis thispart partofofthe the statement true statement trueor or false? false? ( x. Smiling(x)) ( y. WearingHat(y))
89 The Existential Quantifier IsIsthis thisoverall overall statement statementtrue trueor or false? false? ( x. Smiling(x)) ( y. WearingHat(y))
90 The Existential Quantifier IsIsthis thisoverall overall statement statementtrue trueor or false? false? ( x. Smiling(x)) ( y. WearingHat(y))
91 Some Technical Details
92 Variables and Quantifiers Each quantifier has two parts: the variable that is introduced, and the statement that's being quantified. The variable introduced is scoped just to the statement being quantified. ( x. Loves(You, x)) ( y. Loves(y, You))
93 Variables and Quantifiers Each quantifier has two parts: the variable that is introduced, and the statement that's being quantified. The variable introduced is scoped just to the statement being quantified. ( x. Loves(You, x)) ( y. Loves(y, You)) The The variable variable xx just just lives lives here. here. The The variable variable yy just just lives lives here. here.
94 Variables and Quantifiers Each quantifier has two parts: the variable that is introduced, and the statement that's being quantified. The variable introduced is scoped just to the statement being quantified. ( x. Loves(You, x)) ( y. Loves(y, You))
95 Variables and Quantifiers Each quantifier has two parts: the variable that is introduced, and the statement that's being quantified. The variable introduced is scoped just to the statement being quantified. ( x. Loves(You, x)) ( x. Loves(x, You))
96 Variables and Quantifiers Each quantifier has two parts: the variable that is introduced, and the statement that's being quantified. The variable introduced is scoped just to the statement being quantified. ( x. Loves(You, x)) ( x. Loves(x, You)) The The variable variable xx just just lives lives here. here. AA different different variable, variable, also also named named x, x, just just lives lives here. here.
97 Operator Precedence (Again) When writing out a formula in first-order logic, the quantifiers and have precedence just below. The statement x. P(x) R(x) Q(x) is parsed like this: ( ( x. P (x) ) R (x) ) Q ( x ) This is syntactically invalid because the variable x is out of scope in the back half of the formula. To ensure that x is properly quantified, explicitly put parentheses around the region you want to quantify: x. (P(x) R(x) Q(x))
98 Time-Out for Announcements!
99 Checkpoints Graded The PS1 checkpoint assignment has been graded. Review your feedback on GradeScope. Contact the staff (via Piazza or by stopping by office hours) if you have any questions. Some notes: Make sure to list your partner through GradeScope. There's a space to list your partner when you submit the assignment. If you forget to do this, they won't get credit for the assignment! Make sure to check your grade ASAP. For the reason listed above, make sure you have a grade recorded. If not, contact the course staff. Plus, that way, you can take our feedback into account when writing up your answers to the rest of the problem set questions. Best of luck on the rest of the problem set!
100 Proofwriting Checklist We ve just released Handout 11, which contains a checklist of five good proofwriting tips. We ll be looking at these five specific points when grading your problem sets. Good idea: Before submitting, reread all of your proofs and make sure that you adhere to the conventions. Already submitted? No worries! You can resubmit and we ll grade the second version.
101 Your Questions
102 Industry or research? PhD or not to PhD? These These are are both both really really good good options options it s it s more more aa matter matter of of what what you re you re interested interested inin working working on on and and what s what s aa better better fit fit for for you. you. Working Working on on aa Ph.D Ph.D gives gives you you aa chance chance to to work work on on aa lot lot of of problems problems you you can t can t typically typically work work on on inin industry. industry. You ll You ll get get aa thorough thorough understanding understanding of of aa particular particular problem problem domain domain and and will will learn learn how how to to work work on on new new problems problems independently. independently. Post-graduation, Post-graduation, you you can can go go into into academia academia (there (there are are aa ton ton of of openings!) openings!) or or industry, industry, and and you ll you ll have have aa lot lot of of flexibility. flexibility. If If you re you re thinking thinking that that you you want want to to do do aa PhD, PhD, I d I d strongly strongly recommend recommend trying trying to to get get involved involved inin research research inin the the CS CS department. department. Keep Keep an an eye eye open open for for CURIS CURIS for for next next year, year, and and feel feel free free to to stop stop by by professors professors office office hours hours to to ask ask them them about about their their work work and and how how to to get get involved. involved. Take Take classes classes outside outside the the CS CS core, core, ifif you you can, can, since since that s that s another another great great way way to to meet meet professors. professors.
103 When have you felt inadequate? I ll I ll take take this this one one inin class class rather rather than than writing writing things things down down for for posterity s posterity s sake, sake, but but the the short short answer answer isis all all the the time. time. As As for for what what should should you you do do about about it?, it?, II don t don t think think there s there s aa one-size-fits one-size-fits all all answer, answer, and and again again I ll I ll take take this this one one inin class. class.
104 What's your favorite game? AA tie tie between between Codenames, Codenames, Bananagrams, Bananagrams, Wise Wise and and Otherwise, Otherwise, and and One One Night Night Werewolf. Werewolf. II love love games games you you can can play play inin aa group group where where you you can can lose lose terribly terribly and and still still have have aa really really good good time. time.
105 Back to CS103!
106 Translating into First-Order Logic
107 Translating Into Logic First-order logic is an excellent tool for manipulating definitions and theorems to learn more about them. Applications: Determining the negation of a complex statement. Figuring out the contrapositive of a tricky implication.
108 Translating Into Logic Translating statements into first-order logic is a lot more difficult than it looks. There are a lot of nuances that come up when translating into first-order logic. We'll cover examples of both good and bad translations into logic so that you can learn what to watch for. We'll also show lots of examples of translations so that you can see the process that goes into it.
109 Using the predicates - Puppy(p), which states that p is a puppy, and - Cute(x), which states that x is cute, write a sentence in first-order logic that means all puppies are cute.
110 An Incorrect Translation All puppies are cute! x. (Puppy(x) Cute(x))
111 An Incorrect Translation All puppies are cute! x. (Puppy(x) Cute(x)) This This should should work work for for any any choice choice of of x, x, including including things things that that aren't aren't puppies. puppies.
112 An Incorrect Translation All puppies are cute! x. (Puppy(x) Cute(x)) This This should should work work for for any any choice choice of of x, x, including including things things that that aren't aren't puppies. puppies.
113 An Incorrect Translation All puppies are cute! x. (Puppy(x) Cute(x)) This This should should work work for for any any choice choice of of x, x, including including things things that that aren't aren't puppies. puppies.
114 An Incorrect Translation All puppies are cute! x. (Puppy(x) Cute(x)) This This should should work work for for any any choice choice of of x, x, including including things things that that aren't aren't puppies. puppies.
115 An Incorrect Translation All puppies are cute! x. (Puppy(x) Cute(x)) This This should should work work for for any any choice choice of of x, x, including including things things that that aren't aren't puppies. puppies.
116 An Incorrect Translation All puppies are cute! x. (Puppy(x) Cute(x)) This This should should work work for for any any choice choice of of x, x, including including things things that that aren't aren't puppies. puppies.
117 An Incorrect Translation All puppies are cute! x. (Puppy(x) Cute(x)) AA statement statement of of the the form form x. x. something something isis true true only only when when something something isis true true for for every every choice choice of of x. x.
118 An Incorrect Translation All puppies are cute! x. (Puppy(x) Cute(x)) AA statement statement of of the the form form x. x. something something isis true true only only when when something something isis true true for for every every choice choice of of x. x.
119 An Incorrect Translation All puppies are cute! x. (Puppy(x) Cute(x))
120 An Incorrect Translation All puppies are cute! x. (Puppy(x) Cute(x)) This This first-order first-order statement statement isis false false even even though though the the English English statement statement isis true. true. Therefore, Therefore, itit can't can't be be aa correct correct translation. translation.
121 An Incorrect Translation All puppies are cute! x. (Puppy(x) Cute(x)) The The issue issue here here isis that that this this statement statement asserts asserts that that everything everything isis aa puppy. puppy. That's That's too too strong strong of of aa claim claim to to make. make.
122 A Better Translation All puppies are cute! x. (Puppy(x) Cute(x))
123 A Better Translation All puppies are cute! x. (Puppy(x) Cute(x)) This This should should work work for for any any choice choice of of x, x, including including things things that that aren't aren't puppies. puppies.
124 A Better Translation All puppies are cute! x. (Puppy(x) Cute(x)) This This should should work work for for any any choice choice of of x, x, including including things things that that aren't aren't puppies. puppies.
125 A Better Translation All puppies are cute! x. (Puppy(x) Cute(x)) This This should should work work for for any any choice choice of of x, x, including including things things that that aren't aren't puppies. puppies.
126 A Better Translation All puppies are cute! x. (Puppy(x) Cute(x)) This This should should work work for for any any choice choice of of x, x, including including things things that that aren't aren't puppies. puppies.
127 A Better Translation All puppies are cute! x. (Puppy(x) Cute(x)) This This should should work work for for any any choice choice of of x, x, including including things things that that aren't aren't puppies. puppies.
128 A Better Translation All puppies are cute! x. (Puppy(x) Cute(x)) This This should should work work for for any any choice choice of of x, x, including including things things that that aren't aren't puppies. puppies.
129 A Better Translation All puppies are cute! x. (Puppy(x) Cute(x)) This This should should work work for for any any choice choice of of x, x, including including things things that that aren't aren't puppies. puppies.
130 A Better Translation All puppies are cute! x. (Puppy(x) Cute(x)) This This should should work work for for any any choice choice of of x, x, including including things things that that aren't aren't puppies. puppies.
131 A Better Translation All puppies are cute! x. (Puppy(x) Cute(x)) This This should should work work for for any any choice choice of of x, x, including including things things that that aren't aren't puppies. puppies.
132 A Better Translation All puppies are cute! x. (Puppy(x) Cute(x)) This This should should work work for for any any choice choice of of x, x, including including things things that that aren't aren't puppies. puppies.
133 A Better Translation All puppies are cute! x. (Puppy(x) Cute(x)) This This should should work work for for any any choice choice of of x, x, including including things things that that aren't aren't puppies. puppies.
134 A Better Translation All puppies are cute! x. (Puppy(x) Cute(x)) This This should should work work for for any any choice choice of of x, x, including including things things that that aren't aren't puppies. puppies.
135 A Better Translation All puppies are cute! x. (Puppy(x) Cute(x)) This This should should work work for for any any choice choice of of x, x, including including things things that that aren't aren't puppies. puppies.
136 A Better Translation All puppies are cute! x. (Puppy(x) Cute(x)) This This should should work work for for any any choice choice of of x, x, including including things things that that aren't aren't puppies. puppies.
137 A Better Translation All puppies are cute! x. (Puppy(x) Cute(x)) This This should should work work for for any any choice choice of of x, x, including including things things that that aren't aren't puppies. puppies.
138 A Better Translation All puppies are cute! x. (Puppy(x) Cute(x)) This This should should work work for for any any choice choice of of x, x, including including things things that that aren't aren't puppies. puppies.
139 A Better Translation All puppies are cute! x. (Puppy(x) Cute(x)) This This should should work work for for any any choice choice of of x, x, including including things things that that aren't aren't puppies. puppies.
140 A Better Translation All puppies are cute! x. (Puppy(x) Cute(x)) This This should should work work for for any any choice choice of of x, x, including including things things that that aren't aren't puppies. puppies.
141 A Better Translation All puppies are cute! x. (Puppy(x) Cute(x)) This This should should work work for for any any choice choice of of x, x, including including things things that that aren't aren't puppies. puppies.
142 A Better Translation All puppies are cute! x. (Puppy(x) Cute(x)) This This should should work work for for any any choice choice of of x, x, including including things things that that aren't aren't puppies. puppies.
143 A Better Translation All puppies are cute! x. (Puppy(x) Cute(x)) This This should should work work for for any any choice choice of of x, x, including including things things that that aren't aren't puppies. puppies.
144 A Better Translation All puppies are cute! x. (Puppy(x) Cute(x)) This This should should work work for for any any choice choice of of x, x, including including things things that that aren't aren't puppies. puppies.
145 A Better Translation All puppies are cute! x. (Puppy(x) Cute(x))
146 A Better Translation All puppies are cute! x. (Puppy(x) Cute(x)) AA statement statement of of the the form form x. x. something something isis true true only only when when something something isis true true for for every every choice choice of of x. x.
147 A Better Translation All puppies are cute! x. (Puppy(x) Cute(x)) AA statement statement of of the the form form x. x. something something isis true true only only when when something something isis true true for for every every choice choice of of x. x.
148 All P's are Q's translates as x. (P(x) Q(x))
149 Useful Intuition: Universally-quantified statements are true unless there's a counterexample. x. (P(x) Q(x)) If If xx isis aa counterexample, counterexample, itit must must have have property property PP but but not not have have property property Q. Q.
150 Using the predicates - Blobfish(b), which states that b is a blobfish, and - Cute(x), which states that x is cute, write a sentence in first-order logic that means some blobfish is cute.
151 Using the predicates - Blobfish(b), which states that b is a blobfish, and - Cute(x), which states that x is cute, write a sentence in first-order logic that means some blobfish is cute.
152 Using the predicates - Blobfish(b), which states that b is a blobfish, and - Cute(x), which states that x is cute, write a sentence in first-order logic that means some blobfish is cute.
153 An Incorrect Translation Some blobfish is cute. x. (Blobfish(x) Cute(x))
154 An Incorrect Translation Some blobfish is cute. x. (Blobfish(x) Cute(x))
155 An Incorrect Translation Some blobfish is cute. x. (Blobfish(x) Cute(x))
156 An Incorrect Translation Some blobfish is cute. x. (Blobfish(x) Cute(x))
157 An Incorrect Translation Some blobfish is cute. x. (Blobfish(x) Cute(x))
158 An Incorrect Translation Some blobfish is cute. x. (Blobfish(x) Cute(x))
159 An Incorrect Translation Some blobfish is cute. x. (Blobfish(x) Cute(x)) AA statement statement of of the the form form x. x. something something isis true true only only when when something something isis true true for for at at least least one one choice choice of of x. x.
160 An Incorrect Translation Some blobfish is cute. x. (Blobfish(x) Cute(x)) AA statement statement of of the the form form x. x. something something isis true true only only when when something something isis true true for for at at least least one one choice choice of of x. x.
161 An Incorrect Translation Some blobfish is cute. x. (Blobfish(x) Cute(x))
162 An Incorrect Translation Some blobfish is cute. x. (Blobfish(x) Cute(x)) This This first-order first-order statement statement isis true true even even though though the the English English statement statement isis false. false. Therefore, Therefore, itit can't can't be be aa correct correct translation. translation.
163 An Incorrect Translation Some blobfish is cute. x. (Blobfish(x) Cute(x)) The The issue issue here here isis that that implications implications are are true true whenever whenever the the antecedent antecedent isis false. false. This This statement statement accidentally accidentally isis true true because because of of what what happens happens when when xx isn't isn't aa blobfish. blobfish.
164 A Correct Translation Some blobfish is cute. x. (Blobfish(x) Cute(x))
165 A Correct Translation Some blobfish is cute. x. (Blobfish(x) Cute(x))
166 A Correct Translation Some blobfish is cute. x. (Blobfish(x) Cute(x))
167 A Correct Translation Some blobfish is cute. x. (Blobfish(x) Cute(x))
168 A Correct Translation Some blobfish is cute. x. (Blobfish(x) Cute(x))
169 A Correct Translation Some blobfish is cute. x. (Blobfish(x) Cute(x))
170 A Correct Translation Some blobfish is cute. x. (Blobfish(x) Cute(x))
171 A Correct Translation Some blobfish is cute. x. (Blobfish(x) Cute(x))
172 A Correct Translation Some blobfish is cute. x. (Blobfish(x) Cute(x))
173 A Correct Translation Some blobfish is cute. x. (Blobfish(x) Cute(x))
174 A Correct Translation Some blobfish is cute. x. (Blobfish(x) Cute(x))
175 A Correct Translation Some blobfish is cute. x. (Blobfish(x) Cute(x))
176 A Correct Translation Some blobfish is cute. x. (Blobfish(x) Cute(x))
177 A Correct Translation Some blobfish is cute. x. (Blobfish(x) Cute(x))
178 A Correct Translation Some blobfish is cute. x. (Blobfish(x) Cute(x))
179 A Correct Translation Some blobfish is cute. x. (Blobfish(x) Cute(x))
180 A Correct Translation Some blobfish is cute. x. (Blobfish(x) Cute(x))
181 A Correct Translation Some blobfish is cute. x. (Blobfish(x) Cute(x))
182 A Correct Translation Some blobfish is cute. x. (Blobfish(x) Cute(x))
183 A Correct Translation Some blobfish is cute. x. (Blobfish(x) Cute(x))
184 A Correct Translation Some blobfish is cute. x. (Blobfish(x) Cute(x))
185 A Correct Translation Some blobfish is cute. x. (Blobfish(x) Cute(x)) AA statement statement of of the the form form x. x. something something isis true true only only when when something something isis true true for for at at least least one one choice choice of of x. x.
186 A Correct Translation Some blobfish is cute. x. (Blobfish(x) Cute(x)) AA statement statement of of the the form form x. x. something something isis true true only only when when something something isis true true for for at at least least one one choice choice of of x. x.
187 Some P is a Q translates as x. (P(x) Q(x))
188 Useful Intuition: Existentially-quantified statements are false unless there's a positive example. x. (P(x) Q(x)) If If xx isis an an example, example, itit must must have have property property PP on on top top of of property property Q. Q.
189 Good Pairings The quantifier usually is paired with. x. (P(x) Q(x)) The quantifier usually is paired with. x. (P(x) Q(x)) In the case of, the connective prevents the statement from being false when speaking about some object you don't care about. In the case of, the connective prevents the statement from being true when speaking about some object you don't care about.
190 Next Time First-Order Translations Quantifier Orderings How do you select the order of quantifiers in first-order logic formulas? Negating Formulas How do we translate from English into first-order logic? How do you mechanically determine the negation of a firstorder formula? Expressing Uniqueness How do we say there s just one object of a certain type?
Mathematical Logic Part Two
Mathematical Logic Part Two Recap from Last Time Recap So Far A propositional variable a variable that either true or false. The propositional connectives are as follows: Negation: p Conjunction: p q Djunction:
More informationMathematical Logic Part Two
Mathematical Logic Part Two A Note on the Career Fair Recap from Last Time Recap So Far A propositional variable is a variable that is either true or false. The propositional connectives are as follows:
More informationMathematical Logic Part Two
Mathematical Logic Part Two A Note on the Career Fair Recap from Last Time Recap So Far A propositional variable is a variable that is either true or false. The propositional connectives are as follows:
More informationMathematical Logic Part One
Mathematical Logic Part One Question: How do we formalize the logic we've been using in our proofs? Where We're Going Propositional Logic (Today) Basic logical connectives. Truth tables. Logical equivalences.
More informationMathematical Logic Part One
Mathematical Logic Part One Question: How do we formalize the logic we've been using in our proofs? Where We're Going Propositional Logic (Today) Basic logical connectives. Truth tables. Logical equivalences.
More informationFirst-Order Translation Checklist
CS103 Winter 2019 First-Order Translation Checklist Cynthia Lee Keith Schwarz In this handout, we ve distilled five specific points that you should check in your first-order logic statements before submitting
More informationCS103 Handout 29 Winter 2018 February 9, 2018 Inductive Proofwriting Checklist
CS103 Handout 29 Winter 2018 February 9, 2018 Inductive Proofwriting Checklist In Handout 28, the Guide to Inductive Proofs, we outlined a number of specifc issues and concepts to be mindful about when
More informationCS103 Spring 2018 Mathematical Vocabulary
CS103 Spring 2018 Mathematical Vocabulary You keep using that word. I do not think it means what you think it means. - Inigo Montoya, from The Princess Bride Consider the humble while loop in most programming
More informationProofwriting Checklist
CS103 Winter 2019 Proofwriting Checklist Cynthia Lee Keith Schwarz Over the years, we ve found many common proofwriting errors that can easily be spotted once you know how to look for them. In this handout,
More informationProgram Verification & Testing; Review of Propositional Logic
8/24: p.1, solved; 9/20: p.5 Program Verification & Testing; Review of Propositional Logic CS 536: Science of Programming, Fall 2018 A. Why Course guidelines are important. Active learning is the style
More informationFunctions, High-School Edition
Functions What is a function? Functions, High-School Edition f(x) = x4 5x2 + 4 source: https://saylordotorg.github.io/text_intermediate-algebra/section_07/6aaf3a5ab540885474d58855068b64ce.png source: http://study.com/cimages/multimages/16/asymptote_1.jpg
More informationfor all x, the assertion P(x) is false. there exists x, for which the assertion P(x) is true.
You can t prove a predicate is true because a predicate is not an assertion, you can t prove it is valid as it is not a deduction! If someone asks you to prove P(x), it is not totally clear what they mean.
More informationFormal Methods of Software Design, Eric Hehner, segment 1 page 1 out of 5
Formal Methods of Software Design, Eric Hehner, segment 1 page 1 out of 5 [talking head] Formal Methods of Software Engineering means the use of mathematics as an aid to writing programs. Before we can
More informationCS103 Handout 50 Fall 2018 November 30, 2018 Problem Set 9
CS103 Handout 50 Fall 2018 November 30, 2018 Problem Set 9 What problems are beyond our capacity to solve? Why are they so hard? And why is anything that we've discussed this quarter at all practically
More informationUniversity of Illinois at Chicago Department of Computer Science. Final Examination. CS 151 Mathematical Foundations of Computer Science Fall 2012
University of Illinois at Chicago Department of Computer Science Final Examination CS 151 Mathematical Foundations of Computer Science Fall 2012 Thursday, October 18, 2012 Name: Email: Print your name
More informationStrategies for Proofs
Strategies for Proofs Landscape with House and Ploughman Van Gogh Discrete Structures (CS 173) Madhusudan Parthasarathy, University of Illinois 1 Goals of this lecture A bit more logic Reviewing Implication
More informationLecture Notes 15 Number systems and logic CSS Data Structures and Object-Oriented Programming Professor Clark F. Olson
Lecture Notes 15 Number systems and logic CSS 501 - Data Structures and Object-Oriented Programming Professor Clark F. Olson Number systems The use of alternative number systems is important in computer
More informationMathematical Logic Prof. Arindama Singh Department of Mathematics Indian Institute of Technology, Madras. Lecture - 9 Normal Forms
Mathematical Logic Prof. Arindama Singh Department of Mathematics Indian Institute of Technology, Madras Lecture - 9 Normal Forms In the last class we have seen some consequences and some equivalences,
More informationIn our first lecture on sets and set theory, we introduced a bunch of new symbols and terminology.
Guide to and Hi everybody! In our first lecture on sets and set theory, we introduced a bunch of new symbols and terminology. This guide focuses on two of those symbols: and. These symbols represent concepts
More informationChapter 1.3 Quantifiers, Predicates, and Validity. Reading: 1.3 Next Class: 1.4. Motivation
Chapter 1.3 Quantifiers, Predicates, and Validity Reading: 1.3 Next Class: 1.4 1 Motivation Propositional logic allows to translate and prove certain arguments from natural language If John s wallet was
More informationRange Minimum Queries Part Two
Range Minimum Queries Part Two Recap from Last Time The RMQ Problem The Range Minimum Query (RMQ) problem is the following: Given a fixed array A and two indices i j, what is the smallest element out of
More informationGuide to First-Order Logic Translations
Guide to First-Order Logic Translations Hi everybody! In last Friday's lecture, we talked about how to translate statements from English into frst-order logic. Translating into logic is a skill that takes
More informationMITOCW watch?v=kz7jjltq9r4
MITOCW watch?v=kz7jjltq9r4 PROFESSOR: We're going to look at the most fundamental of all mathematical data types, namely sets, and let's begin with the definitions. So informally, a set is a collection
More informationCS 161 Computer Security
Wagner Spring 2014 CS 161 Computer Security 1/27 Reasoning About Code Often functions make certain assumptions about their arguments, and it is the caller s responsibility to make sure those assumptions
More informationPractice Problems: All Computer Science majors are people. Some computer science majors are logical thinkers. Some people are logical thinkers.
CSE 240, Fall, 2013 Homework 2 Due, Tuesday September 17. Can turn in class, at the beginning of class, or earlier in the mailbox labelled Pless in Bryan Hall, room 509c. Practice Problems: 1. Consider
More informationShared Variables and Interference
Solved Shared Variables and Interference CS 536: Science of Programming, Fall 2018 A. Why Parallel programs can coordinate their work using shared variables, but it s important for threads to not interfere
More informationCMPSCI 250: Introduction to Computation. Lecture #7: Quantifiers and Languages 6 February 2012
CMPSCI 250: Introduction to Computation Lecture #7: Quantifiers and Languages 6 February 2012 Quantifiers and Languages Quantifier Definitions Translating Quantifiers Types and the Universe of Discourse
More informationShared Variables and Interference
Illinois Institute of Technology Lecture 24 Shared Variables and Interference CS 536: Science of Programming, Spring 2018 A. Why Parallel programs can coordinate their work using shared variables, but
More informationLogical Connectives. All kittens are cute. ; I like pizza. ; The sky is blue. ; Triangles have three sides.
Logical Connectives We have learned what a statement is. Recall that a statement is just a proposition that asserts something that is either true or false. For instance, these are propositions: All kittens
More informationPropositional Logic. Part I
Part I Propositional Logic 1 Classical Logic and the Material Conditional 1.1 Introduction 1.1.1 The first purpose of this chapter is to review classical propositional logic, including semantic tableaux.
More informationCS103 Handout 35 Spring 2017 May 19, 2017 Problem Set 7
CS103 Handout 35 Spring 2017 May 19, 2017 Problem Set 7 What can you do with regular expressions? What are the limits of regular languages? In this problem set, you'll explore the answers to these questions
More informationL05 - Negating Statements
L05 - Negating Statements CSci/Math 2112 15 May 2015 1 / 14 Assignment 1 Assignment 1 is now posted Due May 22 at the beginning of class Can work on it in groups, but separate write-up Don t forget your
More informationNotes. Notes. Introduction. Notes. Propositional Functions. Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry.
Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Spring 2006 1 / 1 Computer Science & Engineering 235 Introduction to Discrete Mathematics Sections 1.3 1.4 of Rosen cse235@cse.unl.edu Introduction
More informationTo prove something about all Boolean expressions, we will need the following induction principle: Axiom 7.1 (Induction over Boolean expressions):
CS 70 Discrete Mathematics for CS Fall 2003 Wagner Lecture 7 This lecture returns to the topic of propositional logic. Whereas in Lecture 1 we studied this topic as a way of understanding proper reasoning
More informationCS Bootcamp Boolean Logic Autumn 2015 A B A B T T T T F F F T F F F F T T T T F T F T T F F F
1 Logical Operations 1.1 And The and operator is a binary operator, denoted as, &,, or sometimes by just concatenating symbols, is true only if both parameters are true. A B A B F T F F F F The expression
More informationCPSC 121: Models of Computation. Module 6: Rewriting predicate logic statements
CPSC 121: Models of Computation Module 6: Rewriting predicate logic statements Module 6: Rewriting predicate logic statements Pre-class quiz #7 is due March 1st at 19:00. Assigned reading for the quiz:
More informationBinary Relations Part One
Binary Relations Part One Outline for Today Binary Relations Reasoning about connections between objects. Equivalence Relations Reasoning about clusters. A Fundamental Theorem How do we know we have the
More informationMITOCW watch?v=4dj1oguwtem
MITOCW watch?v=4dj1oguwtem PROFESSOR: So it's time to examine uncountable sets. And that's what we're going to do in this segment. So Cantor's question was, are all sets the same size? And he gives a definitive
More informationCITS2211 Discrete Structures Logic
CITS2211 Discrete Structures Logic Unit coordinator: Rachel Cardell-Oliver August 6, 2017 Highlights All men are mortal, Socrates is a man, therefore Socrates is mortal. Reading Chapter 3: Logical Formulas
More informationSo many Logics, so little time
So many Logics, so little time One classical way to organize them is by tractability vs. expressivity. Description Logics (DLs) are basically subsets of FO logic, located in a 'sweet spot' which provides
More informationPropositional Logic Formal Syntax and Semantics. Computability and Logic
Propositional Logic Formal Syntax and Semantics Computability and Logic Syntax and Semantics Syntax: The study of how expressions are structured (think: grammar) Semantics: The study of the relationship
More informationThese are notes for the third lecture; if statements and loops.
These are notes for the third lecture; if statements and loops. 1 Yeah, this is going to be the second slide in a lot of lectures. 2 - Dominant language for desktop application development - Most modern
More informationSkill 1: Multiplying Polynomials
CS103 Spring 2018 Mathematical Prerequisites Although CS103 is primarily a math class, this course does not require any higher math as a prerequisite. The most advanced level of mathematics you'll need
More informationSets. Margaret M. Fleck. 15 September 2010
Sets Margaret M. Fleck 15 September 2010 These notes cover set notation, operations on sets, and how to prove claims involving sets (Rosen sections 2.1 and 2.2). They also cover some logic subtleties that
More informationCS 3512, Spring Instructor: Doug Dunham. Textbook: James L. Hein, Discrete Structures, Logic, and Computability, 3rd Ed. Jones and Barlett, 2010
CS 3512, Spring 2011 Instructor: Doug Dunham Textbook: James L. Hein, Discrete Structures, Logic, and Computability, 3rd Ed. Jones and Barlett, 2010 Prerequisites: Calc I, CS2511 Rough course outline:
More informationSection 2.4: Arguments with Quantified Statements
Section 2.4: Arguments with Quantified Statements In this section, we shall generalize the ideas we developed in Section 1.3 to arguments which involve quantified statements. Most of the concepts we shall
More informationFor next Tuesday. Read chapter 8 No written homework Initial posts due Thursday 1pm and responses due by class time Tuesday
For next Tuesday Read chapter 8 No written homework Initial posts due Thursday 1pm and responses due by class time Tuesday Any questions? Program 1 Imperfect Knowledge What issues arise when we don t know
More informationPropositional Logic. Application of Propositional logic
DISCRETE STRUCTURE Propositional Logic Application of Propositional logic Propositional logic is the study of propositions (true or false statements) and ways of combining them (logical operators) to
More informationMulti-Place Predicates and Multiple Quantifiers
Multi-Place Predicates and Multiple Quantifiers So far we have looked only at monadic predicates. That is, predicates that apply to only one thing. For instance, Fa might mean Alice is friendly. But, what
More informationFinite Automata Part Three
Finite Automata Part Three Recap from Last Time A language L is called a regular language if there exists a DFA D such that L( D) = L. NFAs An NFA is a Nondeterministic Finite Automaton Can have missing
More informationPropositional Calculus: Boolean Algebra and Simplification. CS 270: Mathematical Foundations of Computer Science Jeremy Johnson
Propositional Calculus: Boolean Algebra and Simplification CS 270: Mathematical Foundations of Computer Science Jeremy Johnson Propositional Calculus Topics Motivation: Simplifying Conditional Expressions
More informationSolutions to Selected Exercises
Chapter 1 Solutions to Selected Exercises Section 1.1 2. {2, 4} 3. {7, 10} 5. {2, 3, 5, 6, 8, 9} 6. {1, 3, 5, 7, 9, 10} 8. A 9. 11. B 12. {1, 4} 14. {1} 15. {2, 3, 4, 5, 6, 7, 8, 9, 10} 18. 1 19. 3 22.
More informationLecture 5: Predicate Calculus. ffl Predicate Logic ffl The Language ffl Semantics: Structures
Lecture 5: Predicate Calculus ffl Predicate Logic ffl The Language ffl Semantics: Structures 1 Why Predicate Logic? Propositional logic is not powerful enough to express statements such as ffl For every
More informationQuantification. Using the suggested notation, symbolize the statements expressed by the following sentences.
Quantification In this and subsequent chapters, we will develop a more formal system of dealing with categorical statements, one that will be much more flexible than traditional logic, allow a deeper analysis
More informationHomework 1. Due Date: Wednesday 11/26/07 - at the beginning of the lecture
Homework 1 Due Date: Wednesday 11/26/07 - at the beginning of the lecture Problems marked with a [*] are a littlebit harder and count as extra credit. Note 1. For any of the given problems make sure that
More informationSummary of Course Coverage
CS-227, Discrete Structures I Spring 2006 Semester Summary of Course Coverage 1) Propositional Calculus a) Negation (logical NOT) b) Conjunction (logical AND) c) Disjunction (logical inclusive-or) d) Inequalities
More informationPredicate Logic CHAPTER What This Chapter Is About
CHAPTER 14 Predicate Logic We now turn our attention to a generalization of propositional logic, called predicate, or first-order, logic. Predicates are functions of zero or more variables that return
More informationThis is already grossly inconvenient in present formalisms. Why do we want to make this convenient? GENERAL GOALS
1 THE FORMALIZATION OF MATHEMATICS by Harvey M. Friedman Ohio State University Department of Mathematics friedman@math.ohio-state.edu www.math.ohio-state.edu/~friedman/ May 21, 1997 Can mathematics be
More informationTo prove something about all Boolean expressions, we will need the following induction principle: Axiom 7.1 (Induction over Boolean expressions):
CS 70 Discrete Mathematics for CS Spring 2005 Clancy/Wagner Notes 7 This lecture returns to the topic of propositional logic. Whereas in Lecture Notes 1 we studied this topic as a way of understanding
More informationCS70 - Lecture 6. Graphs: Coloring; Special Graphs. 1. Review of L5 2. Planar Five Color Theorem 3. Special Graphs:
CS70 - Lecture 6 Graphs: Coloring; Special Graphs 1. Review of L5 2. Planar Five Color Theorem 3. Special Graphs: Trees: Three characterizations Hypercubes: Strongly connected! Administration You need
More informationBinary, Hexadecimal and Octal number system
Binary, Hexadecimal and Octal number system Binary, hexadecimal, and octal refer to different number systems. The one that we typically use is called decimal. These number systems refer to the number of
More informationComputation Club: Gödel s theorem
Computation Club: Gödel s theorem The big picture mathematicians do a lot of reasoning and write a lot of proofs formal systems try to capture the ideas of reasoning and proof in a purely mechanical set
More informationLOGIC AND DISCRETE MATHEMATICS
LOGIC AND DISCRETE MATHEMATICS A Computer Science Perspective WINFRIED KARL GRASSMANN Department of Computer Science University of Saskatchewan JEAN-PAUL TREMBLAY Department of Computer Science University
More informationCSE 311: Foundations of Computing. Lecture 8: Predicate Logic Proofs
CSE 311: Foundations of Computing Lecture 8: Predicate Logic Proofs Last class: Propositional Inference Rules Two inference rules per binary connective, one to eliminate it and one to introduce it Elim
More information6.034 Notes: Section 10.1
6.034 Notes: Section 10.1 Slide 10.1.1 A sentence written in conjunctive normal form looks like ((A or B or not C) and (B or D) and (not A) and (B or C)). Slide 10.1.2 Its outermost structure is a conjunction.
More informationGuidelines for Writing Mathematical Proofs
Appendix A Guidelines for Writing Mathematical Proofs One of the most important forms of mathematical writing is writing mathematical proofs. The writing of mathematical proofs is an acquired skill and
More informationToday s Topics. What is a set?
Today s Topics Introduction to set theory What is a set? Set notation Basic set operations What is a set? Definition: A set is an unordered collection of objects Examples: Sets can contain items of mixed
More informationCPSC 121 Some Sample Questions for the Final Exam Tuesday, April 15, 2014, 8:30AM
CPSC 121 Some Sample Questions for the Final Exam Tuesday, April 15, 2014, 8:30AM Name: Student ID: Signature: Section (circle one): George Steve Your signature acknowledges your understanding of and agreement
More informationPropositional Logic:
CS2209A 2017 Applied Logic for Computer Science Lecture 2 Propositional Logic: Syntax, semantics, truth table Instructor: Yu Zhen Xie Language of logic: building blocks Proposition: A sentence that can
More informationCPSC 121: Models of Computation. Module 5: Predicate Logic
CPSC 121: Models of Computation Module 5: Predicate Logic Module 5: Predicate Logic Midterm 1: Friday February 9 th, 17:00 to 18:15 A to C (by last name): room DMP 310 D to K: room MATH 100 L to P: room
More informationOutline for Today. Why could we construct them in time O(n)? Analyzing data structures over the long term.
Amortized Analysis Outline for Today Euler Tour Trees A quick bug fix from last time. Cartesian Trees Revisited Why could we construct them in time O(n)? Amortized Analysis Analyzing data structures over
More informationSection 2.2: Introduction to the Logic of Quantified Statements
Section 2.2: Introduction to the Logic of Quantified Statements In this section, we shall continue to examine some of the fundamentals of predicate calculus. Specifically, we shall look at the negations
More informationCS103 Handout 13 Spring 2018 April 6, 2018 Problem Set 1
CS103 Handout 13 Spring 2018 April 6, 2018 Problem Set 1 Here we are the first problem set of the quarter! This problem set is designed to give you practice writing proofs on a variety of different topics.
More informationn! = 1 * 2 * 3 * 4 * * (n-1) * n
The Beauty and Joy of Computing 1 Lab Exercise 9: Problem self-similarity and recursion Objectives By completing this lab exercise, you should learn to Recognize simple self-similar problems which are
More informationFirst Order Predicate Logic CIS 32
First Order Predicate Logic CIS 32 Functionalia Demos? HW 3 is out on the web-page. Today: Predicate Logic Constructing the Logical Agent Predicate Logic First-order predicate logic More expressive than
More informationCPSC 121: Models of Computation Assignment #4, due Thursday, March 16 th,2017at16:00
CPSC 121: Models of Computation Assignment #4, due Thursday, March 16 th,2017at16:00 [18] 1. Consider the following predicate logic statement: 9x 2 A, 8y 2 B,9z 2 C, P(x, y, z)! Q(x, y, z), where A, B,
More informationPropositional Calculus. CS 270: Mathematical Foundations of Computer Science Jeremy Johnson
Propositional Calculus CS 270: Mathematical Foundations of Computer Science Jeremy Johnson Propositional Calculus Objective: To provide students with the concepts and techniques from propositional calculus
More informationx 2 + 3, r 4(x) = x2 1
Math 121 (Lesieutre); 4.2: Rational functions; September 1, 2017 1. What is a rational function? It s a function of the form p(x), where p(x) and q(x) are both polynomials. In other words, q(x) something
More informationPHIL 240, Introduction to Logic, Sections Fall 2011 FINAL EXAM 14 December Name (5 points): Section (5 points):
Section I True / False questions (2 points each) 1. TRUE Any argument that is sound is also valid. 2. FALSE_ If the premises of an argument are all true, then that argument is sound. 3. TRUE Every universal
More informationThe Stack, Free Store, and Global Namespace
Pointers This tutorial is my attempt at clarifying pointers for anyone still confused about them. Pointers are notoriously hard to grasp, so I thought I'd take a shot at explaining them. The more information
More informationCSE 20 DISCRETE MATH. Fall
CSE 20 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Final exam The final exam is Saturday December 16 11:30am-2:30pm. Lecture A will take the exam in Lecture B will take the exam
More informationA Random Walk through CS70
A Random Walk through CS70 CS70 Summer 2016 - Lecture 8B David Dinh 09 August 2016 UC Berkeley 1 Today (and tomorrow, and Wednesday) Review: what have we done in class? Future classes: where do you go
More informationCS221 / Autumn 2017 / Liang & Ermon. Lecture 17: Logic II
CS221 / Autumn 2017 / Liang & Ermon Lecture 17: Logic II Review: ingredients of a logic Syntax: defines a set of valid formulas (Formulas) Example: Rain Wet Semantics: for each formula, specify a set of
More informationOverview. CS389L: Automated Logical Reasoning. Lecture 6: First Order Logic Syntax and Semantics. Constants in First-Order Logic.
Overview CS389L: Automated Logical Reasoning Lecture 6: First Order Logic Syntax and Semantics Işıl Dillig So far: Automated reasoning in propositional logic. Propositional logic is simple and easy to
More information61A LECTURE 1 FUNCTIONS, VALUES. Steven Tang and Eric Tzeng June 24, 2013
61A LECTURE 1 FUNCTIONS, VALUES Steven Tang and Eric Tzeng June 24, 2013 Welcome to CS61A! The Course Staff - Lecturers Steven Tang Graduated L&S CS from Cal Back for a PhD in Education Eric Tzeng Graduated
More informationPropositional Calculus: Boolean Functions and Expressions. CS 270: Mathematical Foundations of Computer Science Jeremy Johnson
Propositional Calculus: Boolean Functions and Expressions CS 270: Mathematical Foundations of Computer Science Jeremy Johnson Propositional Calculus Objective: To provide students with the concepts and
More informationCS112 Friday, September 12, 2008
CS112 Friday, September 12, 2008 Agenda Natural Deduction Questions FOL Translations FOL Interpretations Natural Deduction Questions? First Order Logic Translations Symbolization Key Universe of Discourse
More informationPROFESSOR: Last time, we took a look at an explicit control evaluator for Lisp, and that bridged the gap between
MITOCW Lecture 10A [MUSIC PLAYING] PROFESSOR: Last time, we took a look at an explicit control evaluator for Lisp, and that bridged the gap between all these high-level languages like Lisp and the query
More informationLecture 6,
Lecture 6, 4.16.2009 Today: Review: Basic Set Operation: Recall the basic set operator,!. From this operator come other set quantifiers and operations:!,!,!,! \ Set difference (sometimes denoted, a minus
More informationIntroduction to Sets and Logic (MATH 1190)
Introduction to Sets and Logic () Instructor: Email: shenlili@yorku.ca Department of Mathematics and Statistics York University Dec 4, 2014 Outline 1 2 3 4 Definition A relation R from a set A to a set
More informationCSL105: Discrete Mathematical Structures. Ragesh Jaiswal, CSE, IIT Delhi
is another way of showing that an argument is correct. Definitions: Literal: A variable or a negation of a variable is called a literal. Sum and Product: A disjunction of literals is called a sum and a
More informationOutline for Today. The Pigeonhole Principle. Graph Theory Party Tricks. The Hadwiger-Nelson Problem. Results that are too big to fail.
Graphs Part Two Outline for Today The Pigeonhole Principle Graph Theory Party Tricks Results that are too big to fail. Applying graph theory to real life! The Hadwiger-Nelson Problem A glimpse of advanced
More informationProblem One: A Quick Algebra Review
CS103A Winter 2019 Solutions for Week One Handout 01S Problem One: A Quick Algebra Review In the first week of CS103, we'll be doing a few proofs that will require some algebraic manipulations and reasoning
More informationThe Haskell HOP: Higher-order Programming
The Haskell HOP: Higher-order Programming COS 441 Slides 6 Slide content credits: Ranjit Jhala, UCSD Agenda Haskell so far: First-order functions This time: Higher-order functions: Functions as data, arguments
More informationAutomated Reasoning PROLOG and Automated Reasoning 13.4 Further Issues in Automated Reasoning 13.5 Epilogue and References 13.
13 Automated Reasoning 13.0 Introduction to Weak Methods in Theorem Proving 13.1 The General Problem Solver and Difference Tables 13.2 Resolution Theorem Proving 13.3 PROLOG and Automated Reasoning 13.4
More informationTuring Machines Part Two
Turing Machines Part Two Recap from Last Time The Turing Machine A Turing machine consists of three parts: A finite-state control that issues commands, an infinite tape for input and scratch space, and
More informationRecursively Enumerable Languages, Turing Machines, and Decidability
Recursively Enumerable Languages, Turing Machines, and Decidability 1 Problem Reduction: Basic Concepts and Analogies The concept of problem reduction is simple at a high level. You simply take an algorithm
More informationFinal Solution. CS510, Fall 2012, Drexel University Ariel Stolerman
CS510 Final Solution 1 Ariel Stolerman Final Solution CS510, Fall 2012, Drexel University Ariel Stolerman 1) There is a refinement of the algorithm called the algorithm. Assume that you are given a heuristic
More informationFinite Automata Part Three
Finite Automata Part Three Recap from Last Time A language L is called a regular language if there exists a DFA D such that L( D) = L. NFAs An NFA is a Nondeterministic Finite Automaton Can have missing
More informationBack to the knights and knaves island
Back to the knights and knaves island During your Thanksgiving trip, you found another island with knights and knaves (you have a feeling that you may encounter many such islands this semester). Knights
More information